/*

 */
#include <iostream>
#include <vector>
#include <queue>
#include <algorithm>
#include <cmath>

#define FORR(i,b,e) for(int i=(b);i<(int)(e);++i)
#define FOR(i,e) FORR(i,0,e)
#define sortuniq(v) sort(v.begin(), v.end()), v.erase(unique(v.begin(),v.end()),v.end())
#define dump(var) cerr << #var ": " << var << "\n"
#define dumpc(con) for(auto& e: con) cerr << e << " "; cerr<<"\n"

typedef long long ll;
typedef unsigned long long ull;

const double EPS = 1e-6;
const int d4[] = {0, -1, 0, 1, 0};

using namespace std;


int gcd(int m, int n) {
    int t;
    while (m != 0) {
        t = m;
        m = n % m;
        n = t;
    }
    return n;
}

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);

    int a[2];
    cin >> a[0] >> a[1];
    int d = gcd(a[0], a[1]);
    a[0] /= d; a[1] /= d;


    int count = 0;
    if (a[0] < a[1]) {
        swap(a[0], a[1]);
        count++;
    }
    while (a[1]>=1) {
        count += a[0] / a[1];
        if (a[1] == 1) {
            cout << count-1 << endl;
            return 0;
        }
        a[0] = a[0] % a[1];
        swap(a[0], a[1]);
        count++;
    }
    cout << -1 << endl;

    return 0;
}