#include <iostream> #include <algorithm> using namespace std; struct Node { int a,b; } a[100003]; int n; bool cmp(Node x,Node y) { if (x.a==y.a) return x.b<y.b; return x.a<y.a; } int main() { scanf("%d",&n); for (int i=1;i<=n;++i) scanf("%d%d",&a[i].a,&a[i].b); sort(a+1,a+n+1,cmp); for (int i=1;i<=n;++i) printf("%d %d\n",a[i].a,a[i].b); return 0; }