#include <iostream>
#include <iomanip>
#include <vector>
#include <utility>
#include <map>
#include <algorithm>
#include <queue>
#include <cmath>
#include <numeric>
#include <set>

using namespace std;
struct aaa{aaa(){cin.tie(nullptr); ios::sync_with_stdio(false); cout<<fixed<<setprecision(20);};}aaa;
template <class T>ostream &operator<<(ostream &o,const vector<T>&v){o<<"{";for(int i=0;i<(int)v.size();i++)o<<(i>0?", ":"")<<v[i];o<<"}";return o;}
#define debug(v) {cerr<<"\033[1;36m[debug]\033[m "<<#v<<" : "<<v<<endl;}

using int64 = long long;

vector<bool> diviser(int n) {
    vector<bool> d(n+1);
    for (int i=2; i*i<=n; i++) {
        if (n % i == 0) {
            d[i] = true;
            while(n % i == 0) n/=i;
        }
    }
    if (n != 1) d[n] = true;
    return d;
}

int main() {
    int a,b;
    cin >> a >> b;
    vector<bool> diva = diviser(a);
    vector<bool> divb = diviser(b);

    if (a == 1 || b == 1) {
        cout << 0 << endl;
        return 0;
    }

//    debug(diva);
//    debug(divb);
    for (int i=2; i<=min(a,b); i++)
        if (diva[i] && divb[i]) {
            cout << -1 << endl;
            return 0;
        }

    vector<bool> dp(10000,false);
    dp[0] = true;
    for (int i=a; i<10000; i++) dp[i] = dp[i] || dp[i-a];
    for (int i=b; i<10000; i++) dp[i] = dp[i] || dp[i-b];

    int ans = 0;
    for (int i=0; i<10000; i++) if (!dp[i]) ans++;
    cout << ans << endl;
}