#include <iostream>
#include <vector>
#include <string>
#include <sstream>
#include <algorithm>
#include <map>
#include <set>
#include <cstdio>
#include <cmath>
#include <cstring>
#include <stack>
#include <queue>
#include <utility>
#define rep(i,l,n) for(lint i=l;i<n;i++)
#define rer(i,l,n) for(lint i=l;i<=n;i++)
#define all(a) a.begin(),a.end()
#define o(a) cout<<a<<endl
#define fi first
#define se second
using namespace std;
typedef long long lint;
typedef vector<int> vi;
typedef vector<lint> vli;
typedef vector<vi> vvi;
typedef pair<int,int> pii;

int main(){
	int A,B,ans=0;
	cin>>A>>B;
	rep(i,0,110){
		rep(j,0,110){
			double x,y,a=(double)i,b=(double)j;
			x=100.0*a/(a+b);
			y=100.0*b/(a+b);
			if((int)(x+0.5)==A && (int)(y+0.5)==B){
				ans=i+j;
				i=110;
				j=110;
			}
		}
	}
	o(ans);
}