#include <iostream>
#include <algorithm>
#include <bits/stdc++.h>
using namespace std;
//This c++ file is for solving problem:
struct node{
	string n;
	int y,m,d,i;
}a[1000000];
int n;
bool cmp(node x,node y){
	if(x.y!=y.y)return x.y<y.y;
	if(x.m!=y.m)return x.m<y.m;
	if(x.d!=y.d)return x.d<y.d;
	return x.i<y.i;
}
int main(){
	cin>>n;
	for(int i=1;i<=n;i++){
		cin>>a[i].n>>a[i].y>>a[i].m>>a[i].d;
		a[i].i=i;
	}
	sort(a+1,a+1+n,cmp);
	for(int i=1;i<=n;i++){
		cout<<a[i].n<<endl;
	}
	return 0;
}