#include<iostream> #include<string> #include<algorithm> using namespace std; struct q{ string ne,bi,nu; }s[15]; bool cm(q x,q y){ if(x.bi!=y.bi) return x.bi<y.bi; if(x.ne!=y.ne) return x.ne<y.ne; return x.nu<y.nu; } int main(){ int n; cin>>n; for(int i=1;i<=n;++i){ cin>>s[i].ne>>s[i].bi>>s[i].nu; } sort(s+1,s+1+n,cm); for(int i=1;i<=n;++i){ cout<<s[i].ne<<" "<<s[i].bi<<" "<<s[i].nu<<" "<<endl; } return 0; }