//前方睾♂能
 #include<set>  
  #include<map>  
   #include<list>  
    #include<queue>  
     #include<stack>  
      #include<string>  
       #include<math.h>  
        #include<time.h>  
         #include<vector>  
          #include<bitset>  
           #include<memory>  
            #include<utility>  
             #include<stdio.h>  
              #include<sstream>  
               #include<iostream>  
                #include<stdlib.h>  
                 #include<string.h>
                  #include<algorithm> 
                 //#include<bits/stdc++.h>//_______________________________________\\
           //       #define LL unsigned long long___________________________________\\
            //#define QAQ(a,b,c,d) for(a=b;a<=c;a+=d)||------------------------------》 
           //       #define LL unsigned long long￣￣￣￣￣￣￣￣￣￣￣￣￣￣￣￣￣ //
                 //#include<bits/stdc++.h>\\￣￣￣￣￣￣￣￣￣￣￣￣￣￣￣￣￣￣￣ //
                  #include<algorithm> 
                 #include<string.h> 
                #include<stdlib.h>
               #include<iostream> 
              #include<sstream>
             #include<stdio.h> 
            #include<utility>  
           #include<memory>  
          #include<bitset>  
         #include<vector>  
        #include<time.h>  
       #include<math.h>  
      #include<string>  
     #include<stack> 
    #include<queue> 
   #include<list>  
  #include<map> 
 #include<set>
//继续睾♂能
 #include<set>  
  #include<map>  
   #include<list>  
    #include<queue>  
     #include<stack>  
      #include<string>  
       #include<math.h>  
        #include<time.h>  
         #include<vector>  
          #include<bitset>  
           #include<memory>  
            #include<utility>  
             #include<stdio.h>  
              #include<sstream>  
               #include<iostream>  
                #include<stdlib.h>  
                 #include<string.h>
                  #include<algorithm> 
                 //#include<bits/stdc++.h>//_______________________________________\\
           //       #define LL unsigned long long___________________________________\\
            //#define QAQ(a,b,c,d) for(a=b;a<=c;a+=d)||------------------------------》 
           //       #define LL unsigned long long￣￣￣￣￣￣￣￣￣￣￣￣￣￣￣￣￣ //
                 //#include<bits/stdc++.h>\\￣￣￣￣￣￣￣￣￣￣￣￣￣￣￣￣￣￣￣ //
                  #include<algorithm> 
                 #include<string.h> 
                #include<stdlib.h>
               #include<iostream> 
              #include<sstream>
             #include<stdio.h> 
            #include<utility>  
           #include<memory>  
          #include<bitset>  
         #include<vector>  
        #include<time.h>  
       #include<math.h>  
      #include<string>  
     #include<stack> 
    #include<queue> 
   #include<list>  
  #include<map> 
 #include<set>
//停止睾♂能
using namespace std;
struct gay
{
    int n,y,r,t;
    char name[21];
}q[101];
bool cmp(gay a,gay b)
{
    if(a.n!=b.n)return a.n<b.n;
    else
    {
        if(a.y!=b.y)return a.y<b.y;
        else
        {
        	if(a.r!=b.r)return a.r<b.r;
        	else
        	{
        		if(a.t!=b.t)return a.t>b.t;
            }
        }
    }
}
int main()
{
    int nn;
    cin>>nn;
    for(int i = 1; i <= nn; ++i)
    {
        cin>>q[i].name>>q[i].n>>q[i].y>>q[i].r;
        q[i].t=i;
    }
    sort(q+1,q+nn+1,cmp);
    for(int i=1;i<=nn;++i)cout<<q[i].name<<endl;
    return 0;
}