#include<bits/stdc++.h>
using namespace std;
int n;
int main(){
cin>>n;
int bg1[110],bg2[110],dj[110],num=0,dj1[110],sum=0;
string name[110],name1[110],zw2[110],zw1[110],zw[110]={"HuFa","HuFa","ZhangLao","ZhangLao","ZhangLao","ZhangLao","TangZhu","TangZhu","TangZhu","TangZhu","TangZhu","TangZhu","TangZhu","JingYing","JingYing","JingYing","JingYing","JingYing","JingYing","JingYing","JingYing","JingYing","JingYing","JingYing","JingYing","JingYing","JingYing","JingYing","JingYing","JingYing","JingYing","JingYing","JingYing","JingYing","JingYing","JingYing","JingYing","JingYing","BangZhong","BangZhong","BangZhong","BangZhong","BangZhong","BangZhong","BangZhong","BangZhong","BangZhong","BangZhong","BangZhong","BangZhong","BangZhong","BangZhong","BangZhong","BangZhong","BangZhong","BangZhong","BangZhong","BangZhong","BangZhong","BangZhong","BangZhong","BangZhong","BangZhong","BangZhong","BangZhong","BangZhong","BangZhong","BangZhong","BangZhong","BangZhong","BangZhong","BangZhong","BangZhong","BangZhong","BangZhong","BangZhong","BangZhong","BangZhong","BangZhong","BangZhong","BangZhong","BangZhong","BangZhong","BangZhong","BangZhong","BangZhong","BangZhong","BangZhong","BangZhong","BangZhong","BangZhong","BangZhong","BangZhong","BangZhong","BangZhong","BangZhong","BangZhong","BangZhong","BangZhong","BangZhong","BangZhong","BangZhong","BangZhong","BangZhong"};
for(int i=0;i<n;i++){
cin>>name[i]>>zw2[i]>>bg1[i]>>dj[i];
bg2[i]=bg1[i];
}
cout<<endl;
for(int i=0;i<n;i++){
if(zw2[i]=="BangZhu"){
cout<<name[i]<<" BangZhu "<<dj[i]<<endl;
bg2[i]=0;
break;
}
}
for(int i=0;i<n;i++){
if(zw2[i]=="FuBangZhu"){
name1[sum]=name[i];sum++;
}
}
for(int i=0;i<n;i++){
if(zw2[i]=="FuBangZhu"){
cout<<name[i]<<" FuBangZhu "<<dj[i]<<endl;
bg2[i]=0;
}
}
sort(bg2,bg2+n-1);
reverse(bg2,bg2+n-1);
for(int i=0;i<n;i++){
for(int q=0;q<n;q++){
if(bg1[q]==bg2[i]) name1[i]=name[q],dj1[i]=dj[q],zw1[i]=zw[i];
}
}
sort(dj1,dj1+1);
reverse(dj1,dj1+1);
sort(dj1+2,dj1+5);
reverse(dj1+2,dj1+5);
sort(dj1+6,dj1+12);
reverse(dj1+6,dj1+12);
sort(dj1+13,dj1+37);
reverse(dj1+13,dj1+37);
sort(dj1+38,dj1+107);
reverse(dj1+38,dj1+107);
for(int i=0;i<n;i++){
for(int q=0;q<n;q++){
if(dj1[i]==dj[q]) cout<<name[q]<<" "<<zw[num]<<" "<<dj1[i]<<endl;
}
num++;
}
return 0;
}