#include <algorithm>
#include <cstdio>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;

#define ll long long
#define INF (1 << 30)
#define INFLL (1LL << 60)

int main() {
	int a,b,ans = 0;
	cin >> a >> b;
	for(double i = 1;;i++){
		for(double j = 1;;j++){
			if((int)(100 * i / (i + j) + 0.5) == a && (int)(100 * j / (i + j) + 0.5) == b) {
				ans = i + j;
				break;
			}
			if((int)(100 * j / (j + i) + 0.5) == a && (int)(100 * i / (j + i) + 0.5) == b) {
				ans = i + j;
				break;
			}
			if((int)(100 * i / (i + j) + 0.5) == b && (int)(100 * j / (i + j) + 0.5) == a) {
				ans = i + j;
				break;
			}
			if((int)(100 * j / (j + i) + 0.5) == b && (int)(100 * i / (j + i) + 0.5) == a) {
				ans = i + j;
				break;
			}
		}
		if(ans != 0) break;
	}
	cout << ans << endl;
	return 0;
}