#include<bits/stdc++.h>
using namespace std;

struct node{
	string name;
	int y,m,d,i;
}a[101];int n;

bool cmp(node a,node b){
	if (a.y<b.y)return 1;
	if (b.y<a.y)return 0;
	if (a.m<b.m)return 1;
	if (b.m<a.m)return 0;
	if (a.d<b.d)return 1;
	if (b.d<a.d)return 0;
	return a.i<b.i;
}

int main(){
	cin>>n;
	for (int i=0;i<n;++i){
		cin>>a[i].name>>a[i].y>>a[i].m>>a[i].d;
		a[i].i=i;
	}
	sort(a,a+n,cmp);
	cout<<a[0].name;
	for (int i=1;i<n;++i){
		cout<<endl<<a[i].name;
	}
	return 0;
}

记录