    #include <bits/stdc++.h>
    using namespace std;
    #include <math.h>
    #include <iomanip>
    #include <cstdint>
    #include <string>
    #include <sstream>
    template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
    template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
    #define rep(i,n) for (int i = 0; i < (n); ++i)
    typedef long long ll;
    using P=pair<ll,ll>;
    const int INF=1001001001;
    const int mod=1e9+7;
    
    void solve(){
      ll t,n;
      cin>>t>>n;
      int p=100+t;
      set<ll>st;
      rep(i,100){st.insert(p*i/100);}
      vector<ll>b;
      rep(i,p*100/100){
        if(!st.count(i)){
          b.push_back(i);
        }
      }
      ll sz=b.size();
      ll x=(n-1)/sz,y=(n-1)%sz;
      ll ans=p*x+b[y];
      cout<<ans<<endl;
    }
    int main(){
      solve();
      return 0;
    }

#include<iostream>
#include<algorithm>
using namespace std;
int main() {
	int n;
	int k[1001] = {};
	cin >> n;
	int ans, m, b;
	ans = m = b = 0;
	int aa = 0;
	for (int i = 1;i <= n;i++) {
		int a; cin >> a;
		aa = max(aa, a);
		int j = 2;
		while (1) {
			if (a%j == 0) {
				m = j, k[j]++;
				if (a / j == 1) break;
			}
			j++;
		}
		ans = max(ans, m);
	}
	int c = 0;
	for (int i = 2;i <= 1000;i++) {
		if (c <k[i])c = k[i], ans = i;
	}
	cout << ans << endl;
	return 0;
}