#include<bits/stdc++.h>
using namespace std;

struct node
{
	string s;
	int y, m, d, t;
}a[101];

bool cmp(node q, node p)
{
	if ( q.y < p.y || (q.y == p.y && q.m < p.m) || (q.y == p.y && q.m == p.m && q.d < p.d ) || (q.y == p.y && q.m == p.m && q.d == p.d && q.t < p.t)) return 1;
	return 0;
}

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].t = i;
	}
	sort(a+1,a+1+n,cmp);
	for ( int i = 1; i <= n; i++ )
		cout << a[i].s << '\n';
	return 0;
}