#include<bits/stdc++.h>
using namespace std;
int n,u,v;
priority_queue <pair<int,int>> pq;
int main()
{
cin>>n;
while(n--)
{
cin>>u>>v;
pq.push({-u,v});
}
while(!pq.empty())
{
u=-pq.top().first; v=pq.top().second; pq.pop();
cout<<u<<" "<<v<<endl;
}
}
I2luY2x1ZGU8Yml0cy9zdGRjKysuaD4KdXNpbmcgbmFtZXNwYWNlIHN0ZDsKaW50IG4sdSx2Owpwcmlvcml0eV9xdWV1ZSA8cGFpcjxpbnQsaW50Pj4gcHE7CmludCBtYWluKCkKewogICAgY2luPj5uOwogICAgd2hpbGUobi0tKQogICAgewogICAgICAgIGNpbj4+dT4+djsKICAgICAgICBwcS5wdXNoKHstdSx2fSk7CiAgICB9CgogICAgd2hpbGUoIXBxLmVtcHR5KCkpCiAgICB7CiAgICAgICAgdT0tcHEudG9wKCkuZmlyc3Q7IHY9cHEudG9wKCkuc2Vjb25kOyBwcS5wb3AoKTsKCiAgICAgICAgY291dDw8dTw8IiAiPDx2PDxlbmRsOwogICAgfQp9Cg==