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

M,N=map(int,raw_input().split())
d=gcd(M,N)
M/=d
N/=d
ans=0
while N!=M and N!=1:
    if M>N:
        ans+=M/N
        M%=N
    else:
        ans+=1
        M,N=N,M
    d=gcd(M,N)
    M/=d
    N/=d
print ans+M-1