# include<iostream> # include<algorithm> using namespace std; struct C{ int id; int c; int k; }; C s[1001]; bool cmp(C a,C b){ if(a.id!=b.id)return a.id<b.id; if(a.id==b.id && a.c>b.c)return a.c<b.c; if(a.id==b.id && a.c==b.c)return a.k<b.k; } int main(){ int n; cin>>n; for(int i=1;i<=n;i++){ cin>>s[i].id>>s[i].c>>s[i].k; if(s[i].c<s[i].k) swap(s[i].c,s[i].k); } sort(s+1,s+n+1,cmp); for(int i=1;i<=n;i++){ if(s[i].c==s[i+1].c&&s[i].k==s[i+1].k){ cout<<s[i].id<<" "<<s[i].c<<" "<<s[i].k<<endl; i++; } else{ cout<<s[i].id<<" "<<s[i].c<<" "<<s[i].k<<endl; } } return 0; }