#include <iostream>
#include <string>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <list>
#include <iterator>
#include <cassert>
#include <numeric>
#include <functional>
#include <ctime>
#include <bitset>
#pragma warning(disable:4996) 

//#define ATCODER
#ifdef ATCODER
#include <atcoder/all>
#endif

typedef long long ll;
typedef unsigned long long ull;
#define LINF  9223300000000000000
#define LINF2 1223300000000000000
#define LINF3 1000000000000
#define INF 2140000000
const long long MOD = 1000000007;
//const long long MOD = 998244353;

using namespace std;
#ifdef ATCODER
using namespace atcoder;
#endif


void solve()
{
    ll P, Q;
    scanf("%lld%lld", &P, &Q);
    pair<ll, ll> PQ = make_pair(P, Q);
    pair<ll, ll> l = make_pair(1, 0), r = make_pair(0, 1);
    while (1) {
        pair<ll, ll> m = make_pair(l.first + r.first, l.second + r.second);
        if (m == PQ) {
            break;
        }
        else if (P*m.second-Q*m.first>0) {
            r = m;
        }
        else {
            l = m;
        }
    }
    printf("%lld\n", l.first + l.second + r.first + r.second);

    return;
}

int main()
{
#if 1
    solve();
#else
    int T, t;
    scanf("%d", &T);
    for (t = 0; t < T; t++) {
        //printf("Case #%d: ", t + 1);
        solve();
    }
#endif
    return 0;
}