#include<bits/stdc++.h>
using namespace std;
int n;
struct node{
    string s;
    int y,m,d;
}a[105];
int main(){
    cin>>n;
    for(int i=1;i<=n;i++){
        cin>>a[i].s>>a[i].y>>a[i].m>>a[i].d;
    }
    sort(a+1,a+n+1,[](node x,node y){
        if(x.y!=y.y) return x.y<y.y;
        if(x.m!=y.m) return x.m<y.m;
        if(x.d!=y.d) return x.d<y.d;
    });
    for(int i=1;i<=n;i++){
        cout<<a[i].s<<endl;
    }
	return 0;
}