#include<iostream>
#include<algorithm>
using namespace std;
struct sr{
	string name;
	int y;
	int m;
	int d;
}a[105]; 
bool cmp(sr x,sr y){
	if(x.y!=y.y){
		return x.y<y.y;
	}else if(x.m!=y.m){
		return x.m<y.m;
	}else if(x.d!=y.d){
		return x.d<y.d;
	} 
}
int n;
int main(){
    cin>>n;
    for(int i=1;i<=n;i++){
    	cin>>a[i].name>>a[i].y>>a[i].m>>a[i].d;
	}
	sort(a+1,a+n+1,cmp);
	for(int i=1;i<=n;i++){
    	cout<<a[i].name<<" "<<a[i].y<<" "<<a[i].m<<" "<<a[i].d<<endl;
	}
	return 0;
}