#include <bits/stdc++.h> #define REP(i,n,N) for(int i=(n);i<(int) N;i++) #define RREP(i,n,N) for(int i=N-1;i>=(int) n;i--) #define p(s) cout<<(s)<<endl #define DEBUG(x,y) cout<<#x<<": "<<x<<" , "<<#y<<": "<<y<<endl; #define CK(n,a,b) ((a)<=(n)&&(n)<(b)) #define F first #define S second typedef long long ll; using namespace std; const ll mod=1e6+7; int main(void){ int A,B; cin>>A>>B; int ans=500; if(A>B) swap(A,B); if(A==B) ans=2; REP(a,0,201){ REP(b,a+1,201){ int AA=(double)100*a/(a+b)+0.5; int BB=(double)100*b/(a+b)+0.5; if(AA==A&&BB==B) ans=min(ans,a+b); } } p(ans); return 0; }