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