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