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