#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> VI;
typedef vector<VI> VVI;
#define REP(i, n)           for(int(i)=0;(i)<(n);++(i))
#define FOR(i, f, t)        for(int(i)=(f);(i)<(t);(++i))
const int MOD = int(1e9+7);

ll N,M,W,H;
int res = 0;

ll gcd(ll n, ll m){return m?gcd(m,n%m):n;}

int main(){
    cin >> N >> M;
    int c = 0;
    while(1){
        ll g = gcd(N,M);
        N /= g;  M /= g;
        if(M == 1){ c+= N-1; break; }
        if(N < M){
            swap(N,M);
            c++;
        } else {
            N -= M;
            c++;
        }
    }
    cout << c << endl;
    return 0;
}