# include<iostream> # include<algorithm> using namespace std; struct Rectangle{ int id, w, h; void input(){ cin>>id>>w>>h; } void output(){ cout<<id<<" "<<w<<" "<<h<<endl; } bool cmp(Rectangle r2){ return id!=r2.id&&w!=r2.w&&h!=r2.h; } }; bool cmp(Rectangle r1, Rectangle r2){ if(r1.id!=r2.id)return r1.id<r2.id; if(r1.w!=r2.w)return r1.w<r2.w; return r1.h<r2.h; } Rectangle r[1000]; int n; int main(){ cin>>n; for(int i = 0; i < n; i++)r[i].input(); sort(r, r+n, cmp); for(int i = 0; i < n; i++)if(i==0||r[i].cmp(r[i-1]))r[i].output(); return 0; }