#include<stdio.h>
#include<algorithm>
using namespace std;
struct node{
int weight;
char c[100];
}buf[101];
bool cmp(node a,node b)
{
return a.weight>b.weight;
}
int main()
{
int n;
while(scanf("%d",&n)!=EOF){
for(int i=0;i<n;i++) scanf("%d %s",&buf[i].weight,buf[i].c);
sort(buf,buf+n,cmp);
for(int i=0;i<n;i++) printf("%s\n",buf[i].c);
}
return 0;
}
#include<algorithm>
using namespace std;
struct node{
int weight;
char c[100];
}buf[101];
bool cmp(node a,node b)
{
return a.weight>b.weight;
}
int main()
{
int n;
while(scanf("%d",&n)!=EOF){
for(int i=0;i<n;i++) scanf("%d %s",&buf[i].weight,buf[i].c);
sort(buf,buf+n,cmp);
for(int i=0;i<n;i++) printf("%s\n",buf[i].c);
}
return 0;
}