#include<algorithm>
#include<complex>
#include<ctype.h>
#include<iomanip>
#include<iostream>
#include<fstream>
#include<map>
#include<math.h>
#include<numeric>
#include<queue>
#include<set>
#include<stack>
#include<stdio.h>
#include<string>
#include<string>
#include<vector>

using namespace std;
typedef long long ll;

#define FOR(i,a,b) for(ll i=(a);i<(b);++i)
#define ALL(v) (v).begin(), (v).end()
#define p(s) cout<<(s)<<endl
#define p2(s, t) cout << (s) << " " << (t) << endl
#define br() p("")
#define pn(s) cout << (#s) << " " << (s) << endl
#define p_yes() p("Yes")
#define p_no() p("No")

const ll mod = 1e9 + 7;
const ll inf = 1e18;

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

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

    // input
    ll M, N;
    cin >> M >> N;

    if(M==N){
        p(0);
        return 0;
    }

    if(M%N==0){
        p(M/N - 1);
        return 0;
    }

    // 通分
    ll temp = gcd(M, N);
    M /= temp;
    N /= temp;

    ll num = 0;
    while(M!=1){
        if(M>N){
            num += M/N;
            M %= N;
            continue;
        }

        if(M<N){
            num++;
            swap(M, N);
        }
    }

    num++;
    num+=N-1;
    
    p(num);
    
    return 0;
}