/*
TASK:music
LANG:C++
*/
#include<iostream>
#include<cstring>
#include<vector>
#include<cmath>
#include<algorithm>
using namespace std;
int n;int arr[512];int acc[325];
struct participant
{ string name;
  double bal;
  int day;
  int place;
};   
double todig(string s)
{ int f=s.size();
int i;int l=0;double res=0;
for(i=0;i<f;i++)
 if(s[i]=='.')
  { int j;long long int c=1;for(j=i-1;j>=0;j--){res+=(s[j]-'0')*c;c*=10;}
   c=pow(10.0,(f-i));
   long long int d=c*10;
   long long res2=0;
   for(j=i+1;j<f;j++)
    { res2+=(s[j]-'0')*c;c/=10;}
   double res3=double(res2)/double(d);
      
   res+=res3;l=1;
   break;
  }
if(l==1)return res;
else{int c=pow(10.0,double(f)-1.0); 
for(i=0;i<f;i++)
{    res+=c*(s[i]-'0');c/=10;}
return res;}
}
bool cmp(participant p1,participant p2)
{ if(p1.bal<p2.bal)return 0;
  if(p1.bal==p2.bal)
  { if(p1.day>p2.day)return 0;
    if(p1.day==p2.day)
     { if(p1.place>p2.place)return 0;
       if(p1.place<p2.place)return 1;
     }
    return 1;
  }
}          
int main()
{ cin>>n;
vector <participant> p;

int i,j,k;
for(i=0;i<n;i++)
{   string a;
    cin>>a;
   int m;
   arr[i]=int(todig(a));
    if(arr[i]!=0)
     {for(j=1;j<=arr[i]+1;j++)
       { if(j!=arr[i]+1)
       {string s,b;
         cin>>s>>b;;
        participant a;
        a.name=s;
        a.bal=todig(b);
        a.day=i;
        a.place=j;
        p.push_back(a);
        }
       if(j==arr[i]+1)     
        { string las;
         cin>>las;
         acc[i]=int(todig(las));
       }
    }
    sort(p.begin(),p.end(),cmp);   
    for(j=0;j<acc[i];j++)
     p[j].bal=-1;
   }
   if(arr[i]==0)
   { string las;
    cin>>las;
    acc[i]=int(todig(las));
   } 
   /* for(j=0;j<p.size();j++)
     cout<<p[j].name<<' '<<p[j].bal<<endl;           
*/
} 
  
sort(p.begin(),p.end(),cmp);
/*for(j=0;j<p.size();j++)
 cout<<p[j].bal<<' '<<p[j].name<<endl;
*/
if(p[0].bal!=-1)cout<<p[0].name<<"\n";
else cout<<"\n";
//system("pause");
}   

