#include<iostream> #include<algorithm> using namespace std; const int N=1e6; struct node{ int a,b; }a[N]; bool cmp(node x,node y){ if(x.a==y.a){ return x.b<y.b; }return x.a<y.a; } signed main(){ int n; cin>>n; for(int i=1;i<=n;i++){ cin>>a[i].a>>a[i].b; } sort(a+1,a+n+1,cmp); for(int i=1;i<=n;i++){ cout<<a[i].a<<" "<<a[i].b<<"\n"; } return 0; }