#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>

#define p(s) cout<<(s)<<endl
#define REP(i,n,N) for(int i=n;i<N;i++)
#define RREP(i,n,N) for(int i=N-1;i>=n;i--)
#define CK(n,a,b) ((a)<=(n)&&(n)<(b))
#define F first
#define S second
typedef long long ll;
using namespace std;
const int inf=1e9+7;

int A,B;
int ans;
int main(){
    cin>>A>>B;
    ans = inf;
    if(A==0||B==0){
        ans=1;
    }
    else {
        REP(a, 1, 201) {
            REP(b, 1, 201) {
                int aa = 0.5 + (100.0 * a) / (a + b);
                int bb = 0.5 + (100.0 * b) / (a + b);
                if (A == aa && B == bb) {
                    ans = min(ans, a + b);
                }
            }
        }
    }
    p(ans);
    return 0;
}