#include<iostream>
#include<cstring>
#include<algorithm>
using namespace std;
struct node{
    string s;
    long long tot,sum;
};
node a[110];
bool cmp(node a,node b){
    return a.tot<b.tot;
}
int main(){
    int n,y,m,d;
    cin>>n;
    for(int i=1;i<=n;i++){
        a[i].sum=i;
        cin>>a[i].s>>y>>m>>d;
        a[i].tot=y*10000+m*100+d;
    }
    sort(a+1,a+n+1,cmp);
    for(int i=1;i<=n;i++){
        cout<<a[i].s<<endl;
    }
    return 0;
}