#pragma GCC optimize("Ofast")

#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using ll = long long;
#define rep(i, s, t) for (ll i = s; i < (ll)(t); i++)
#define all(x) begin(x), end(x)

template <class T> bool chmin(T& x, T y) {
	return x > y ? (x = y, true) : false;
}
template <class T> bool chmax(T& x, T y) {
	return x < y ? (x = y, true) : false;
}

struct io_setup {
	io_setup() {
		ios::sync_with_stdio(false);
		cin.tie(nullptr);
		cout << fixed << setprecision(15);
	}
} io_setup;

using mint = atcoder::modint998244353;

void solve() {
	ll p, q;
	cin >> p >> q;
	ll lp = 0, lq = 1, rp = 1, rq = 0;
	while (1) {
		ll mp = lp + rp, mq = lq + rq;
		if (mq > q) break;
		if (mp * q == p * mq) break;
		if (mp * q < p * mq) {
			lp = mp, lq = mq;
		} else {
			rp = mp, rq = mq;
		}
	}
	cout << lp + lq + rp + rq << '\n';
}

int main() {
	int t = 1;
	// cin >> t;
	while (t--) solve();
}