#約数列挙
def make_divisors(n):
    lower_divisors , upper_divisors = [], []
    i = 1
    while i*i < n:
        if n % i == 0:
            lower_divisors.append(i)
            if i != n // i:
                upper_divisors.append(n//i)
        i += 1
    return lower_divisors+upper_divisors[::-1]

#めぐる式二部探索
#参考サイト：https://aotamasaki.hatenablog.com/entry/meguru_bisect

def is_ok(arg,tar,n):
    return (arg**n-1)//(arg-1) <= tar

def meguru_bisect(ng, ok, tar, n):
    while (abs(ok - ng) > 1):
        mid = (ok + ng) // 2
        if is_ok(mid,tar,n):
            ok = mid
        else:
            ng = mid
    return ok

N = int(input())
L=make_divisors(N)
ans = N-1
if N == 1:
    print(2)
    exit()
if N == 2:
    print(3)
    exit()


for l in L:
    for i in range(2,41):
        temp = meguru_bisect(10**12+1, 2 ,l ,i)
        if temp>N//l and (temp**i-1)//(temp-1)==l:
            ans = min(temp,ans)
        if temp == 1:
            break

print(ans)