#include<iostream>
#include<algorithm>
using namespace std;

const int N=110;
pair<int,int> a[N];
int n;

bool cmp(pair<int,int> a,pair<int,int> b)
{
	if(a.second!=b.second)
		return a.second<b.second;
	else
		return a.first<b.first;
}

int main()
{
	cin>>n;
	for(int i=0;i<n;i++)
	{
		int id,score;
		cin>>id>>score;
		a[i]={id,score};
	}
	sort(a,a+n,cmp);
	for(int i=0;i<n;i++)
		cout<<a[i].first<<" "<<a[i].second<<endl;
	return 0;
}