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