#include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<map>
#include<utility>
#include<set>
#include<stack>
#include<queue>
#include<deque>
#include<cmath>
#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<bitset>
#include<sstream>
#include<list>
using namespace std;
#define rep(i,n) for((i)=0;(i)<(int)(n);++i)
#define nrep(i,i0,n) for((i)=(i0);(i)<(int)(n);++i)
#define all(o) (o).begin(), (o).end()
#define pb(x) push_back(x)
#define mp(x,y) make_pair((x),(y))
typedef vector<int> vi; typedef pair<int,int> pii; typedef vector<pair<int,int> > vpii;
typedef long long ll;


int main(){
	cin.tie(0);
	ios::sync_with_stdio(false);
	int A,B;
	cin>>A>>B;
	if(A>B)swap(A,B);
	int i,j,k;
	double num;
	for(k=1;k<=100;k++){
	nrep(i,1,k){
	j=k-i;
	num=100.0*i/(i+j);
	if(A-0.5<=num&&num<A+0.5&&100-(B+0.5)<num&&num<=100-(B-0.5))break;
	}
	if(A-0.5<=num&&num<A+0.5&&100-(B+0.5)<num&&num<=100-(B-0.5))break;
	}
	cout<<k<<endl;

	return 0;
}