from math import log, nan


n = int(input())
for p in range(2, n + 2):
    l = [(n // pow(p, i)) % p for i in range(int(log(n, p)) + 1)]
    if len(set(l)) == 1:
        exit(print(p))