#!/usr/bin/env PyPy3

from collections import Counter, defaultdict, deque
import itertools
import re
import math
from functools import reduce
import operator
import bisect
from heapq import *
import functools
mod=998244353

import sys
input=sys.stdin.readline
def is_ok1(x):
    return p * (q - 1) > x * q
def is_ok2(x):
    return p * (q - 1) < x * q
p,q=map(int,input().split())
ql=qr=q-1
ok = 0
ng = 10 ** 9 + 5
while ng - ok > 1:
    mid = (ng + ok) // 2
    if is_ok1(mid):
        ok = mid
    else:
        ng = mid
pl = ok
ok = 10 ** 9 + 5
ng = 0
while ok - ng > 1:
    mid = (ng + ok) // 2
    if is_ok2(mid):
        ok = mid
    else:
        ng = mid
pr = ok
g1 = math.gcd(pl,ql)
pl //= g1
ql //= g1
g2 = math.gcd(pr,qr)
pr //= g2
qr //= g2
print(pl + ql + pr + qr)