#include<iostream>
#include<cstdio>
#include<cstring>
#include <cstdlib>  
#include <cmath>   
#include<cctype>
#include<string>
#include<set>
#include <map>
#include<algorithm>
#include <functional>
#include<vector>
#include<climits>
#include<stack>
#include<queue>
#include <deque>
#include <climits>
#include <typeinfo>
#include <utility> 
#define all(x) (x).begin(),(x).end()
#define rep(i,m,n) for(int i = m;i < n;++i)
#define pb push_back
#define fore(i,a) for(auto &i:a)
#define rrep(i,m,n) for(int i = m;i >= n;--i)
#define INF INT_MAX/2
using namespace std;
using ll = long long;
using R = double;
const ll MOD = 1e9 + 7;
const ll inf = 1LL << 50;
struct edge { ll from; ll to; ll cost; };

int main(){
	int A, B;
	cin >> A >> B;

	int x = 1;
	while (1) {
		int a;
		rep(b, 0, x+1) {
			a = x - b;
			double _A = (double)100 * (double)a / (double)x;
			double _B = (double)100 * (double)b / (double)x;
			int A_ = round(_A);
			int B_ = round(_B);
			if (A_ == A && B_ == B) {
				cout << x << endl;
				return 0;
			}
		}
		x++;
	}


	return 0;
}