#include <iostream>
#include <string>
#include <algorithm>
using namespace std;

struct stu
{
    int id;
    string xm;
    int nian;
    int yue;
    int ri;
}a[110];

bool cmp(stu& s1,stu& s2)
{
    if(s1.nian!=s2.nian)
    {
        return s1.nian<s2.nian;
    }
    else
    {
        if(s1.yue!=s2.yue)
        {
            return s1.yue<s2.yue;
        }
        else
        {
            if(s1.ri!=s2.ri)
            {
                return s1.ri<s2.ri;
            }
            else
            {
                return s1.id>s1.id;
            }
        }
    }
}

int main()
{
    int n;
    cin >> n;
    int i;
    for(i=0;i<n;i++)
    {
        a[i].id = i;
        cin >> a[i].xm >> a[i].nian >>a[i].yue >>a[i].ri;
    }
    sort(a,a+n,cmp);
    for(i=0;i<n;i++)
    {
        cout << a[i].xm <<endl;
    }
    return 0;
}