from math import sqrt
def divisor(N):
    ret = [1]
    for i in range(2,int(sqrt(N))+1):
        if N % i == 0:
            ret.append(i)
            if N // i != i:
                ret.append(N//i)
    ret.sort()
    return ret

N,K = map(int,input().split())
print(max(divisor(N)))