#include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#include <set>
#include <queue>
#include <iomanip>

using namespace std;

typedef long long ll;

int main()
{
	ll n, k;
	cin >> n >> k;

	for (ll q = 0; q < k; q++) {
		if (n % 200 == 0) {
			n /= 200;
		}
		else {
			if (k - q == 1) {
				cout << n * 1000 + 200 << endl;
				return 0;
			}
			else {
				q++;
				n = n * 5 + 1;
			}
		}
	}

	cout << n << endl;
}

//**He who has a why can survive almost any how***
 
#include<bits/stdc++.h>
using namespace std;
 
#define mp make_pair
#define mt make_tuple
#define fi first
#define se second
#define pb push_back
#define ll long long 
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define rep(i,n) for(i=0;i<n;i++)
#define forn(i, n) for (ll i = 0; i < (ll)(n); ++i)
#define for1(i, n) for (ll i = 1; i <= (ll)(n); ++i)
#define ford(i, n) for (ll i = (ll)(n) - 1; i >= 0; --i)
#define fore(i, a, b) for (ll i = (ll)(a); i <= (ll)(b); ++i)
#define fora(it,x) for(auto it:x)
#define PI 3.14159265
#define sync ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define endl "\n"
 
typedef pair<ll, ll> pii;
typedef vector<ll> vi;
typedef vector<pii> vpi;
typedef vector<vi> vvi;
typedef long long i64;
typedef vector<i64> vi64;
typedef vector<vi64> vvi64;
typedef pair<i64, i64> pi64;
typedef long double ld;
 
template<class T> bool uin(T &a, T b) { return a > b ? (a = b, true) : false; }
template<class T> bool uax(T &a, T b) { return a < b ? (a = b, true) : false; }

bool cmp(pair<string,ll>p1,pair<string,ll> p2){
    return(p1.second>p2.second);
}

int main(){
    ll n;
    cin>>n;
    vector<pair<string,ll>> v;
    forn(i,n){
        ll te;
        string ts;
        cin>>ts>>te;
        v.pb(mp(ts,te));
    }
    sort(all(v),cmp);
    cout<<v[1].first;
}