#include <iostream>
#include <cstring>
#include <cstdlib>
#include <cstdio>
#include <cmath>

using namespace std;

int n;

struct node
{
	char st[1001];
	int tim;
}P[10001];

int cmp(const void *a,const void *b)
{
	node *aa=(node *)a;
	node *bb=(node *)b;
	return aa->tim - bb->tim;
}

int main()
{
	freopen("nba.in","r",stdin);
	freopen("nba.out","w",stdout);
	scanf("%d",&n);
	for (int i=1;i<=n;i++)
	{
		scanf("%s%d",&P[i].st,&P[i].tim);
	}
	qsort(P+1,n,sizeof(P[0]),cmp);
	for (int i=1;i<=n;i++)
	{
		printf("%d %s\n",P[i].tim,P[i].st);
	}
	return 0;
}