#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define p(s) cout<<(s)<<endl
#define REP(i,n,N) for(int i=n;i<N;i++)
#define RREP(i,n,N) for(int i=N-1;i>=n;i--)
#define CK(n,a,b) ((a)<=(n)&&(n)<(b))
#define F first
#define S second
typedef long long ll;
using namespace std;
const ll mod = 1e9+7;

int a,b;
int ans;
int main() {
    cin>>a>>b;
    int g=__gcd(a,b);
    a/=g;
    b/=g;
    if(a<b){
        swap(a,b);
        ans++;
    }
    while(b>1){
        ans+=a/b;
        a%=b;
        swap(a,b);
        ans++;
    }
    ans += a-1;
    p(ans);
    return 0;
}