#include<iostream>
#include<cmath>
#include<cstring>
#include<algorithm>
using namespace std;
struct node{
char s;
int id,y,m,d;
};
node a[310];
int n;
bool cmp(node a,node b){
return a.y>b.y||a.y==b.y&&a.m>b.m||a.y==b.y&&a.m==b.m&&a.d>b.d||a.id>b.id;
}
int main(){
cin>>n;
for(int i=0;i<n;i++){
cin>>a[i].s>>a[i].y>>a[i].m>>a[i].d;
a[i].id=i;
}
sort(a,a+n,cmp);
for(int i=0;i<n;i++){
cout<<a[i].s;
}
return 0;
}