#include <iostream>
#include <algorithm>
#include <string> 
using namespace std;
struct dian
{
	string name;
	int nian,yue,ri;
}a[100];
bool mycmp(dian a,dian b)
{
	if(a.nian!=b.nian)
	{
		return a.nian<b.nian;
	}
	if(a.yue!=b.yue)
	{
		return a.yue<b.yue;
	}
	if(a.ri!=b.ri)
	{
		return a.ri<b.ri;
	}
	return 1;
}
int main()
{
	int n,i;
	cin>>n;
	for(i=1;i<=n;i++)
	{
		cin>>a[i].name>>a[i].nian>>a[i].ri>>a[i].yue;
	}
	sort(a+1,a+n+1,mycmp);
	for(i=1;i<n;i++)
	{
		cout<<a[i].name<<endl;
	}
	cout<<a[i].name;
	return 0;
}

萌新求助qwq