//bismillahir rahmanir rahim
//@uthor : mubin_akib

#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")

#include<bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef long double ld;
typedef complex<ld> cd;

typedef pair <int, int> pi;
typedef pair<ll, ll> pl;
typedef pair<ld, ld> pd;

typedef vector<int> vi;
typedef vector<ld> vd;
typedef vector<ll> vl;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
typedef vector<cd> vcd;

#define FOR(i, a, b) for (int i = a; i < (b); i++)
#define F0R(i, a) for (int i = 0; i < (a); i++)
#define FORd(i,a,b) for (int i = (b) - 1; i >= a; i--)
#define F0Rd(i,a) for (int i = (a) - 1; i >= 0; i--)
#define REP(i, a, b) for(int i = (a); i <= (b); ++i)
#define trav(a,x) for(auto& a : x)

#define sz(x) (int)(x).size()
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define lb lower_bound
#define ub upper_bound
#define all(x) x.begin(), x.end()
#define ins insert

template<class T> bool ckmin(T& a, const T& b) { return b < a ? a = b, 1 : 0; }
template<class T> bool ckmax(T& a, const T& b) { return a < b ? a = b, 1 : 0; }

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

const int mod = 1e9 + 7;
const char nl = '\n';
const int N  = 10005;

void solve() {
     string n;
     ll k;
     cin >> n >> k;
     while(k--){
         if(stoll(n) % 200 == 0){
             n = to_string(stoll(n) / 200);
         }
         else{
             n += "200";
         }
     }
     cout << n << nl;
}

int main() {
#ifndef ONLINE_JUDGE
//    freopen("input.txt", "r", stdin);
//    freopen("output.txt", "w", stdout);
#endif
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    solve();
//    int t;
//    cin >> t;
//    while(t--){
//        solve();
//    }
    return 0;
}
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define mod 1000000007
#define endl "\n" 
#define scan(a) scanf("%d", &a)
#define print(a) printf("%d\n", a)

int modadd(int a, int b,int MOD = mod){
    return((a%MOD)+(b%MOD)+MOD)%MOD;
}

int modsub(int a, int b,int MOD = mod){
    return((a%MOD) - (b%MOD) + MOD)%MOD;
}

void fast (void) __attribute__ ((constructor));
void fast (void) { 
    #ifndef ONLINE_JUDGE
        freopen("input.txt", "r", stdin);
        freopen("output.txt", "w", stdout);
    #endif
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
} 

 
void solve(){
   int N;
   cin>>N;
   vector<vector<int>> A(N,vector<int>(5));
    // vector A(N, array<int, 5>{});
   for(auto &a:A) for(int &i:a) cin>>i;
    int ok=0,ng=1000000001;
    
    auto check = [&](int x)->bool {
        set<int> s;
        for(auto &a:A){
            int bit=0;
            for(int &i:a){
                bit <<= 1;
                bit |= i>=x;
            }
            s.insert(bit);
        }
        for(int x:s) for(int y:s) for(int z:s){
            //if all 5 bits are set
            if((x|y|z)==31) return 1;
        }
        return 0;
    };

    while(abs(ok-ng)>1){
        int cen = (ok+ng)/2;
        (check(cen) ? ok : ng) = cen;
    }

    cout<<ok<<endl;

}
  
signed main (void) 
{ 
    // int t;  cin>>t;
    // while(t--)
    {
        solve();
        cout<<"\n";
    }
    return 0; 
} 