#include<iostream>
#include<math.h>
#include<vector>
#include <array>
#include <algorithm>
#include <queue>
#include <numeric>
#include <map>

using namespace std;
#define int long long
#define FOR(i, a, b) for(int i=(a);i<(b);i++)
#define RFOR(i, a, b) for(int i=(b-1);i>=(a);i--)
#define REP(i, n) for(int i=0; i<(n); i++)
#define RREP(i, n) for(int i=(n-1); i>=0; i--)
#define ALL(a) (a).begin(),(a).end()
#define UNIQUE_SORT(l) sort(ALL(l)); l.erase(unique(ALL(l)), l.end());
#define CONTAIN(a, b) find(ALL(a), (b)) != (a).end()
#define array2(type, x, y) array<array<type, y>, x>
#define vector2(type) vector<vector<type> >
#define out(...) //printf(__VA_ARGS__)

typedef pair<int, int> pos;
int pos::*x = &pos::first;
int pos::*y = &pos::second;

int dxy[] = {0, 1, 0, -1, 0};

/*================================*/

int gcd(int m, int n) {
    while(m % n != 0) {
        int r = m % n;
        m = n;
        n = r;
    }
    return n;
}

signed main()
{
    int m, n;
    cin >> m >> n;
    int gcdmn = gcd(m, n);
    while(gcdmn > 1) {
        m /= gcdmn;
        n /= gcdmn;
        gcdmn = gcd(m, n);
    }
    //printf("%lld / %lld\n", m, n);
    int cnt = 0;
    while(1) {
        if (m > n) {
            // 仮分数の場合: 1を引く
            m -= n;
            cnt++;
        }
        if (m < n) {
            // 真分数の場合: 逆数をとる
            swap(m, n);
            cnt++;
        }
        if (n == 1) {
            cout << cnt + m - 1 << endl;
            break;
        }
    }

    return 0;
}