//Author:PanDaoxi
#include <iostream>
using namespace std;
struct p{
char id[15];
int age;
} a[110],b[110],c;
void qsort(int left,int right){
if(left>=right) return;
int i=left,j=right;
p x=a[left];
while(i<j){
while(i<j&&a[j].age<x.age) j--;
a[i]=a[j];
while(i<j&&a[i].age>x.age) i++;
}
a[i]=x;
qsort(left,i-1);
qsort(i+1,right);
return;
}
int main(){
int m;
int f=0,s=0;
cin>>m;
for(int i=0;i<m;i++){
cin>>c.id>>c.age;
if(c.age>=60) a[f++]=c;
else b[s++]=c;
}
qsort(0,f-1);
for(int i=0;i<f;i++){
cout<<a[i].id<<endl;
}
for(int i=0;i<s;i++){
cout<<b[i].id<<endl;
}
return 0;
}