#include<bits/stdc++.h>
#include <iterator>
#include <iostream>
#include <numeric>
#include <math.h>
#define ll long long
#define ull long
#define mpa make_pair
#define pb push_back
#define ff first
#define pii pair<ll,ll>
#define dd double
#define trace(x) cerr << #x << " : " << x << endl
#define ss second
#define boost ios_base::sync_with_stdio(0)
#define forp(i,a,b) for(ll i=a;i<=b;i++)
#define rep(i,n)    for(ll i=0;i<n;++i)
#define ren(i,n)    for(ll i=n-1;i>=0;i--)
#define forn(i,a,b) for(ll i=a;i>=b;i--)
#define all(c) (c).begin(),(c).end()
#define tr(c,i) for(typeof((c).begin()) i = (c).begin(); i != (c).end();
#define sc(x) scanf("%lld",&x)
#define clr(x,val) memset(x,val,sizeof(x))
#define pr(x) prllf("%lld\n",x) 
#define pdd pair<dd,dd>
#define read_arr(a,n) for(ll i=1;i<=n;i++)cin>>a[i];
#define init_arr(a,n) for(ll i=1;i<=n;i++)a[i]=n-i+1;
#define prec(x) cout<<fixed<<setprecision(x)
#define fre freopen("input.txt","r",stdin),freopen("output.txt","w",stdout)
#define arr array 
using namespace std;

void solve(ll tc){
	
	
	ll n;
	cin>>n;
	vector<pair<ll,string> > m(n);
	for(ll i=0;i<n;i++){
		cin>>m[i].ss>>m[i].ff;
	}

	sort(all(m));

	cout<<m[n-2].ss;
	




	
	


}

int main(){
//	fre;
	ll t;
	t=1;
//	cin>>t;

	ll tc=1;

	while(t--){
		solve(tc);
		tc++;
	}

}
	
	
 
 
 
 


	

	







	
	

	
	




		


    
	


		
#include <bits/stdc++.h>
using namespace std;
int main(int argc, char const *argv[])
{
    int n;
    cin >> n;
    vector<pair<int, string> > v(n);
    for (int i = 0; i < n; ++i)
    {
        cin >> v[i].second >> v[i].first;
    }
    sort(v.begin(), v.end());
    cout << v[n - 2].second; 
    return 0;
}