n, k = map(int, input().split())
def gcd(a, b):
    if b==0: return a
    return gcd(b, a%b)
m = 0
for i in range(1, int(n/2)+1):
    m = max(m, gcd(i, n-i))
print(m)