#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define llong long long

int gcd(int a, int b) {
    if(a % b == 0) return b;
    return gcd(b, a % b);
}

int main() {
    int m, n;
    cin >> m >> n;
    int divisor = gcd(max(m, n), min(m, n));
    m /= divisor;
    n /= divisor;
    int result = 0;
    while(m != n) {
        if(m > n) {
            if(m % n == 0) {
                result += m / n - 1;
                m = n;
            } else {
                result += m / n;
                m %= n;
            }
        } else {
            int temp = n;
            n = m;
            m = temp;
            result += 1;
        }
    }

    cout << result << "\n";
}