# エラトステネスで10**5超の素数列挙して互いにかけ算

n = 10**6
is_prime = [1]*(n + 1)
is_prime[0] = 0  
is_prime[1] = 0
for p in range(2, n + 1):
    if is_prime[p]:
        for q in range(2*p, n + 1, p):
            is_prime[q] = 0

primes = []
for i in range(10**5+1, 10**5+200):
    if is_prime[i] == 1:
        primes.append(i)
        
#print(primes)

ans_list = [1]
L = len(primes)
for i in range(L):
    for j in range(i, L):
        p1 = primes[i]
        p2 = primes[j]
        ans_list.append(p1*p2)
ans_list.sort()
    
#print(ans_list)

N = int(input())
ans = ans_list[N-1]
print(ans)