#include<cstdio>
#include<iostream>
#include<algorithm>
#include<string>
#include<queue>
#include<vector>
#include<functional>
#include<cmath>
#include<map>
#include<stack>
#include<set>
#include<numeric>
#include<limits>

using namespace std;
typedef long long ll;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;

int main()
{
	int A, B;
	cin >> A >> B;
	int ans = 100000;

	for (int i = 0; i < 1000; i++) {
		for (int j = 0; j < 1000; j++) {
			if (i == 0 && j == 0)continue;
			int sum = i + j;
			if ((A == round(100 * (double)i / sum)) &&
				(B == round(100 * (double)j / sum))) {
				ans = min(ans,sum);
			}
		}
	}
	cout << ans << endl;
	return 0;
}