#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
using namespace std;
typedef long long int ll;
typedef pair<int,int> P;
#define yn {puts("Yes");}else{puts("No");}
#define MAX_N 200005

// long version
long long int GCD(long long int x, long long int y){
    if(x>y){
        long long int swap = x;
        x = y;
        y = swap;
    }
    while(true){
        if(y%x==0){
            return x;
        }else{
            long long int amari = y%x;
            y = x;
            x = amari;
        }
    }
}

int main() {
    int m,n;
    cin >> m >> n;

    int g = GCD(m,n);
    m /= g;
    n /= g;

    int ans = 0;

    while(true){
        g = GCD(m,n);
        m /= g;
        n /= g;
        if(n == 1){
            ans += m - 1;
            break;
        }
        if(m < n){
            ans++;
            swap(n,m);
        }
        ans += m / n;
        m -= m / n * n;
    }

    cout << ans << endl;
    return 0;
}