import bisect
import math


def hurui(N):
    koho = list(range(2, N))
    prime = []
    limit = math.sqrt(koho[-1])
    while True:
        p = koho[0]
        if limit <= p:
            prime = prime + koho
            break
        else:
            prime.append(p)
            koho = [e for e in koho if e % p != 0]

    return prime


primes = hurui(10 ** 5 + 1000)

idx = bisect.bisect_right(primes, 10 ** 5)

primes = primes[idx:]

koho = set()
for p1 in primes:
    for p2 in primes:
        koho.add(p1 * p2)


ans = [1] + sorted(list(koho))

print(ans[int(input()) - 1])