#include typedef long long ll; using namespace std; int INF = 1e9; int MOD = 1e9+7; main(){ int A,B,minsum = 10000; cin >> A >> B; for(int i = 0;i <= 1000;i++){ for(int j = 0;j <= 1000;j++){ if(!i && !j)continue; if(A == round(100.*i/(i+j)) && B == round(100.*j/(i+j))){ minsum = min(minsum,i+j); } } } cout << minsum << endl; }