                            /*Bismillahir Rahmanir Rahim*/
 
 
#include<bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define ff      first
#define ss      second
#define ll      long long int
#define dd      double
#define pb      push_back
#define mp      make_pair
#define pr      pair<ll,ll>
#define pqmx    priority_queue<ll>
#define pqmn    priority_queue<ll,vector<ll>,greater<ll>>
#define mod     1000000007
#define pd(x,y)     fixed<<setprecision(y)<<x
#define w(x)     ll x; cin>>x; while(x--)
#define loop(i,x,n) for(ll i=x;i<n;i++)
#define rloop(x,n) for(ll i=n-1;i>=x;i--)
#define all(x)            (x).begin(),(x).end()
#define rall(x)            (x).rbegin(),(x).rend()
#define IOS     ios::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr)

//Apna Time Aayega :)

using namespace std;

signed main()
{
    
   
        ll n,ans=1;
        cin>>n;
        (n%2==0) ? (cout<<"White"<<endl) :  (cout<<"Black"<<endl) ;
  
 }

#include "bits/stdc++.h"
//#include "atcoder/all"
using namespace std;
//using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
//using mint = modint998244353;
//const int mod = 998244353;
//const int INF = 1e9;
//const long long LINF = 1e18;
//const bool debug = false;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n-1); i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r-1);i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define endl "\n"
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }
bool a[200];
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	long long n, t;
	cin >> t >> n;
	n--;
	rep(i, 100) {
		int num = (100 + t)*i / 100;
		a[num] = true;
	}
	vector<int>list;
	rep(i, 100 + t) {
		if (!a[i]) list.push_back(i);
	}
	/*rep(i, list.size()) {
		cout << list[i] << endl;
	}*/
	long long ans = (n / list.size())*(100 + t) + list[n%list.size()];
	cout << ans << endl;
	return 0;
}