#include <bits/stdc++.h>
using namespace std;

map<int, string> vis;

signed main() {
  int n; cin >> n;
  for ( int i = 0; i < n; ++ i ) {
  	string s;
    int x;
    cin >> s >> x;
    vis[x] = s;
  }
  int num = 1;
  for ( auto iter: vis ) {
    if ( num == vis.size() - 1 ) {
      cout << iter.second << endl;
  	  break;
    }
    num ++;
  }
  return 0;
}
#include<bits/stdc++.h>
using namespace std;
template <class T> ostream &operator << (ostream &os, const vector<T> &p) { os << "["; for (auto&it : p) os << it << " "; return os << "]";}
template <class S, class T> ostream &operator << (ostream &os, const pair<S, T> &p) { return os << "(" << p.first << "," << p.second << ")";}
#ifndef ONLINE_JUDGE
#define deb(...) dbs(#__VA_ARGS__,__VA_ARGS__)
template <class T> void dbs(string str, T t) { cerr << str << ":" << t << "\n";}
template<class T, class...S> void dbs(string str, T t, S... s) { int idx = str.find(','); cerr << str.substr(0, idx) << ":" << t << ","; dbs(str.substr(idx + 1), s...);}
#else
#define deb(...){}
#endif
#define int long long
#define ld long double
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define ini(x, y) memset(x, y, sizeof(x))
#define pr(x) {cout << x << '\n'; return;}
#define prl(x) {cout << x << '\n';}
#define nl cout<< '\n'
#define rep(i,n) for(int i = 0; i < n; i++)
#define re(i,n) for(int i = 1; i <= n; i++)
#define fr(i,a,b) for(int i = a; i <= b; i++)
#define fb(i,a,b) for(int i = a; i >= b; i--)
#define vi vector<int>
#define pii pair<int, int>
#define vii vector<pii>
template<class T> bool umin(T &a, T b) { return a > b ? (a = b, true) : false; }
template<class T> bool umax(T &a, T b) { return a < b ? (a = b, true) : false; }
const int N = 2e5 + 3; // check the limits

void solve(int tc) {
	int n; cin>>n;
	vector<pair<int,string>> v;
	rep(i,n){
		string s;int x; cin>>s>>x;
		v.pb({x,s});
	}
	sort(all(v));
	pr(v[n-2].se);

}
signed main() {
	ios_base :: sync_with_stdio(0); cin.tie(0); cout.tie(0);
	int q = 1;
	// cin >> q;
	for (int _t = 1; _t <= q; _t++) solve(_t);
}