#include <bits/stdc++.h> using namespace std; struct node{ int num1, num2; }a[110000]; bool cmp(node x, node y){ if(x.num1 == y.num1) return x.num2 < y.num2; return x.num1 < y.num1; } int main(){ int n; scanf("%d",&n); for(int i = 1; i <= n; i++){ cin >> a[i].num1 >> a[i].num2; } std::sort(a + 1, a + n + 1, cmp); for(int i = 1; i <= n; i++){ cout << a[i].num1<< " " << a[i].num2 << endl; } return 0; }