#include <iostream>
#include <cstdio>
#include <vector>
#include <algorithm>
#include <utility>

using namespace std;

int gcd(int a, int b) {
	return b == 0 ? a : gcd(b, a % b);
}

int main() {
	int m, n;

	cin >> m >> n;
	int tmp = gcd(m, n);
	m /= tmp;
	n /= tmp;

	int ans = 0;
	while(n != 1) {
		if (m > n) {
			m -= n;
		} else {
			swap(m, n);
		}
		ans++;
	}
	ans += m - 1;
	cout << ans << endl;

	return 0;
}