from math import gcd

def modinv(a, b):
    p = b
    x, y, u, v = 1, 0, 0, 1
    while b:
        k = a // b
        x -= k * u
        y -= k * v
        x, u = u, x
        y, v = v, y
        a, b = b, a % b
    x %= p
    if x < 0:
        x += p
    return x

def calcR(p, q):
    inv = modinv(-p, q)
    G = gcd(inv-q, p)
    return (inv-q+p)/G

def calcL(p, q):
    inv = modinv(q, -p)
    G = gcd(inv-p, q)
    return (inv-p+q)/G

p, q = map(int, input().split())
print(calcL(p, q)+calcR(p, q))