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