#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
#define N 1010
using namespace std;
int n;
int read()
{
    ,f=; char ch=getchar();
    ;ch=getchar();}
    +ch-',ch=getchar();
    return x*f;
}
struct Node
{
    string s;
    int y,m,d,num;
}node[N];
int cmp(Node a,Node b)
{
    if(a.y!=b.y) return a.y<b.y;
    if(a.m!=b.m) return a.m<b.m;
    if(a.d!=b.d) return a.d<b.d;
    return a.num>b.num;
}
int main()
{
    n=read();
    ;i<=n;i++)
    {
        cin>>node[i].s;
        node[i].y=read();
        node[i].m=read();
        node[i].d=read();
        node[i].num=i;
    }
    sort(node+,node++n,cmp);
    ;i<=n;i++)
     cout<<node[i].s<<endl;
    ;
}