/*
  Author     : MatsuTaku
  Date         : 06/13/21
  Certificate:
ssh-rsa AAAAB3NzaC1yc2EAAAADAQABAAAAgQDF9T447OEo8XSQ6O1AznN5tKC8mzvYc4Zs3+oOKfMqgLXfOwQnpfcoxKs4MAP1eICBD13PkcIezJ9IlV6nKQZKs1BQmvjSXJ+zKK8YCKvAueNPuNO0Bim43IBaNHNFWcMvcmUvHgRb6hUSO0V8I7OsjiFo20KDBj3gAznu9tir0Q== CompetitiveProgrammingCertification:tkm.matsumoto@gmail.com
*/

#include <bits/stdc++.h>
using namespace std;
#include <x86intrin.h>
#define REP(i, l, r)      for (int i = (l), i##_less = (r); i < i##_less; i++)
#define rep(i, n)         REP(i, 0, n)
#define RREP(i, l, r)     for (int i = (r)-1, i##_least = (l); i >= i##_least; i--)
#define rrep(i, n)        RREP(i, 0, n)
#define chmax(dst, x)     dst = max(dst, (x))
#define chmin(dst, x)     dst = min(dst, (x))
using lint = long long int;
using ulint = unsigned long long int;
template<typename T>
using vvec = vector<vector<T>>;
template<typename T>
vvec<T> make_vvec(int n, int m, T v) { return vvec<T>(n, vector<T>(m, v)); }

class Solver {
 public:
  Solver();
  void solve();
};

Solver::Solver() {}

void Solver::solve() {
  int a,b; cin>>a>>b;
  cout << (double)a/100*b << endl;
}

int main() {
  cin.tie(nullptr); ios::sync_with_stdio(false);
  cout<<fixed<<setprecision(10);
  Solver solver;
  int t = 1;
//  cin>>t;
  while (t--) {
    solver.solve();
  }
  return 0;
}

#include <bits/stdc++.h>
using namespace std;
using lli = long long int;
#define ip(a) lli a; cin >> a
#define ipfl(a) double a; cin >> a
#define ipstr(a) string a; cin >> a
#define op(a) cout << a
#define opspc(a) cout << a << "\n"
#define FOR0(i, n) for(lli i = 0; i < n; i++)
#define FORa(i, a, n) for(lli i = a; i <= n; i++)
#define pb push_back
#define mem(a, b) memset(a, b, sizeof(a))
#define all(arr) arr.begin(), arr.end()
#define vi vector<lli>
#define pwr(a, b) (lli)(pow(a*1.0, b*1.0))

vi primearr(0);

lli fact(lli n); 

bool sortbysec(const pair<int,int> &a, const pair<int,int> &b)
{
    return (a.second < b.second);
}

void genPrime(lli n)
{
    bool prime[n + 1];
    memset(prime, true, sizeof(prime));
 
    for (lli p = 2; p * p <= n; p++)
    {
        if (prime[p] == true) 
        {
            for (lli i = p * p; i <= n; i += p)
            {
                prime[i] = false;
            }
        }
    }
    for (lli p = 2; p <= n; p++)
    {
        if (prime[p])
        {
            primearr.pb(p);
        }
    }
}

lli lcm(lli a, lli b)
{
    return a * b / __gcd(a, b);
}
  
lli nCr(lli n, lli r) 
{ 
    return fact(n) / (fact(r) * fact(n - r)); 
} 
  
// Returns factorial of n 
lli fact(lli n) 
{ 
    lli res = 1; 
    for (lli i = 2; i <= n; i++) 
        res = res * i; 
    return res; 
}

void solve()
{
	ip(n);
	string st[n];
	int v[n];
	int maxe = INT_MIN;
	int cnt = 0;
	for (int i = 0; i < n; ++i)
	{
		cin >> st[i];
		cin >> v[i];
	}
	if(n == 2)
	{
	    if(v[0] < v[1])
	    {
	        cout << st[0] << "\n";
	        return;
	    }
	    else
	    {
	        cout << st[1] << "\n";
	        return;
	    }
	}
// 	for (int i = 0; i < n; ++i)
// 	{
// 		cout << st[i] << " " << v[i] << "\n";
// 	}
	for (int i = 0; i < n; ++i)
	{
	    cnt = 0;
	    for(int j = 0; j < n; j++)
	    {
		    if(v[i] >= v[j])
		    {
		    	cnt++;
		    }
	    }
	    if(cnt == n - 1)
	    {
	        cout << st[i] << "\n";
	        return;
	    }
	}
}

int main()
{
    ios_base::sync_with_stdio(false); 
    cin.tie(NULL);
    // lli t;
    // cin >> t;
    // while(t--)
    // {
        solve();
    // }
}