import sys

def solve():
    N, K = map(int, input().split())
    min_prime = get_min_prime(N)

    if min_prime == N:
        ans = 1
    else:
        ans = N // min_prime

    print(ans)

def get_min_prime(N):
    p = 2
    while p*p <= N:
        if N % p == 0:
            return p
        p += 1

    return N

def debug(x, table):
    for name, val in table.items():
        if x is val:
            print('DEBUG:{} -> {}'.format(name, val), file=sys.stderr)
            return None

if __name__ == '__main__':
    solve()