#include<iostream>
#include<algorithm>
#include<cmath>
#include<string>
using namespace std;
int n;
struct body
{
    string name;
    int y, m, d,l;
}h[105];
bool cmp(body a, body b)
{
    if (a.y != b.y) return a.y < a.y;
    else
    {
        if (a.m != b.m) return a.m < a.m;
        else if (a.m == b.m && a.d != b.d) return a.d < b.d;
        else if (a.m == b.m && a.d == b.d) return a.l > b.l;
    }
}
int main()
{
    cin >> n;
    for (int i = 0; i < n; i++)
    {
        cin >> h[i].name >> h[i].y >> h[i].m >> h[i].d;
        h[i].l = i;
    }
    stable_sort(h, h + n, cmp);
    for (int i = 0; i < n; i++)
    {
        cout << h[i].name << endl;
    }
    return 0;
}