def make_divisors(n):
    for i in range(1, int(n ** 0.5) + 1):
        if n % i == 0:
            yield i
            if i != n // i:
                yield n // i


N = int(input())

if N <= 2:
    print(N + 1)
    exit()

ans = N - 1
for i in make_divisors(N):
    div = N // i
    for x in range(2, 50):
        # bisect
        l, r = 1, max(int(div ** (1 / (x - 1))) + 1, 2)
        while r - l > 1:
            m = (r + l) // 2
            if (m ** x - 1) < div * (m - 1):
                l = m
            else:
                r = m
        if (r ** x - 1) == div * (r - 1) and i < r:
            ans = min(ans, r)
            # print(f'div={div}, x={x}, p={r}')
print(ans)