求助%%%

#include<bits/stdc++.h>
using namespace std;
int n;
struct Node{
	string name;
	int y,m,d;
}a[105];
bool cmp(Node a,Node b){
	if(a.y>b.y)return 1;
	else if(a.y<b.y)return 0;
	else if(a.y==b.y){
		if(a.m>b.m)
		return 1;
		else if(a.m<b.m)
		return 0;
		else if(a.m==b.m){
			if(a.d>b.d)
			return 1;
			else if(a.d<b.d)
			return 0;
			else if(a.d==b.d&&a.m==b.m&&a.y==b.y)
			return 0;
		}
	
	}
	return 0;
}
int main(){
	cin>>n;
	for(int i=1;i<=n;i++){
		cin>>a[i].name>>a[i].y>>a[i].m>>a[i].d;
	}
	sort(a+1,a+n+1,cmp);
	for(int i=n;i>=1;i--)
	cout<<a[i].name<<endl;
  	return 0;
}