def make_primes(n: int) -> list[int]:
    ps = [2]
    t = [True] * (n + 1)
    for i in range(3, n+1, 2):
        if t[i]:
            ps.append(i)
            for j in range(i+i, n+1, i):
                t[j] = False
    return ps


N = int(input())
if N == 1:
    print(1)
    exit()

primes = [p for p in make_primes(10 ** 6) if p > 10**5]
xs = []
for i in range(N):
    for j in range(N):
        xs.append(primes[i] * primes[j])

xs.sort()
ans = xs[N]
print(ans)