def gcd(a, b):
    if b == 0:
        return a
    return gcd(b, a % b)

M, N = map(int, input().split())
g = gcd(M, N)
M //= g
N //= g

ans = 0
while N > 1:
    if M > N:
        M -= N
    else:
        M, N = N, M
    ans += 1
    g = gcd(M, N)
    M //= g
    N //= g
print(ans + (M - 1))