#include <iostream>
#include <algorithm>
using namespace std;
int n;
struct cord{int x,y;}a[10001];
bool cmp(cord m,cord n){return m.x==n.x?m.y<n.y:m.x<n.x;}
int main(){
    cin>>n;
    for(int i=1;i<=n;i++)cin>>a[i].x>>a[i].y;
    sort(a+1,a+n+1,cmp);
    for(int i=1;i<=n;i++)cout<<a[i].x<<' '<<a[i].y<<endl;
    return 0;
}