#include<bits/stdc++.h>
using namespace std;
struct ren{
string xm,xw;
int dj,no,xwn;
long long bg;
}p[114];
bool cmp(ren a,ren b){
if(a.bg==b.bg)
return a.no<b.no;
else
return a.bg>b.bg;
}
bool cmp2(ren a,ren b){
if(a.xwn==b.xwn){
if(a.dj==b.dj)
return a.no<b.no;
else
return a.dj>b.dj;
}
else
return a.xwn>b.xwn;
}
int main(){
int n;
cin>>n;
for(int i=0;i<n;i++){
cin>>p[i].xm>>p[i].xw>>p[i].bg>>p[i].dj;
p[i].no=i;
}
sort(p+4,p+n,cmp);
for(int i=3;i<=n;i++){
if(i<5){
p[i].xw="HuFa";
p[i].xwn=5;
}
else if(i<9){
p[i].xw="ZhangLao";
p[i].xwn=4;
}
else if(i<16){
p[i].xw="TangZhu";
p[i].xwn=3;
}
else if(i<41){
p[i].xw="JingYing";
p[i].xwn=2;
}
else {
p[i].xw="BangZhong";
p[i].xwn=1;
}
}
sort(p+4,p+n,cmp2);
for(int i=0;i<n;i++)
cout<<p[i].xm<<" "<<p[i].xw<<" "<<p[i].dj<<endl;
return 0;
}