using namespace std;
typedef long long ll;
//typedef pair<int,int>pii;
//const int maxn=3e5+49,inf=0x3f3f3f3f;
//ll a[409],point[maxn],sum[109];
//ll b[409],cnt,idx,idy,fa[109];
//char str[maxn];
//ll MOD=1e9+7;
//pii p[maxn];
typedef struct node{
	char name[30];
	int year,month,day,prio;
}mate;
mate people[109];
bool cmp(mate x,mate y){
	if(x.year<y.year)return 1;
	if(x.year==y.year&&x.month<x.month)return 1;
	if(x.year==y.year&&x.month==y.month&&x.day<y.day)return 1;
	if(x.year==y.year&&x.month==y.month&&x.day==y.day&&x.prio>y.prio)return 1;
	return 0;
} 
//map<pii,int>vis,pos;
int main()
{
	int n;
	cin>>n;
	for(int i=1;i<=n;i++){
		cin>>people[i].name;
		cin>>people[i].year;
		cin>>people[i].month;
		cin>>people[i].day;
		people[i].prio=i;
	}
	sort(people+1,people+1+n,cmp);
	for(int i=1;i<=n;i++)cout<<people[i].name<<endl;
	
	return 0;
}