#include <bits/stdc++.h>
using namespace std;
int N;
struct NODE{
int X,Y;
}node[200001];
bool comp(NODE lhs,NODE rhs){
return lhs.X<rhs.X;
}
int main() {
cin>>N;
for(int q=0;q<N;q=q+1){
cin>>node[q].X>>node[q].Y;
}
sort(node,node+N,comp);
return 0;
}
I2luY2x1ZGUgPGJpdHMvc3RkYysrLmg+CnVzaW5nIG5hbWVzcGFjZSBzdGQ7CmludCBOOwpzdHJ1Y3QgTk9ERXsKCWludCBYLFk7Cn1ub2RlWzIwMDAwMV07CmJvb2wgY29tcChOT0RFIGxocyxOT0RFIHJocyl7CglyZXR1cm4gbGhzLlg8cmhzLlg7Cn0KaW50IG1haW4oKSB7CgljaW4+Pk47Cglmb3IoaW50IHE9MDtxPE47cT1xKzEpewoJCWNpbj4+bm9kZVtxXS5YPj5ub2RlW3FdLlk7Cgl9Cglzb3J0KG5vZGUsbm9kZStOLGNvbXApOwoJcmV0dXJuIDA7Cn0=