#include<algorithm>
#include<iostream>
using namespace std;

int n;
struct node{
	string s;
	int y,m,d,id;
	bool operator<(const node &a)const{
		if(this->y!=a.y) return this->y<a.y;
		else if(this->m!=a.m) return this->m<a.m;
		else if(this->d!=a.d) return this->d<a.d;
		else this->id>a.id;
	}
}q[105];
int main(){
	cin>>n;
	for(int i=1;i<=n;i++){
		cin>>q[i].s>>q[i].y>>q[i].m>>q[i].d;
		q[i].id=i;
	}
	sort(q+1,q+n+1);
	for(int i=1;i<=n;i++){
		cout<<q[i].s<<"\n";
	}
	return 0;  
}