import itertools

n = int(input())
ans = [1]
def is_prime(n):
    for i in range(2, int(n ** 0.5) + 1):
        if n % i == 0:
            return False
    return True
    
p_lst = []
for i in range(10 ** 5 + 1, 10 ** 6):
    if is_prime(i):
        p_lst.append(i)
        if len(p_lst) == 10:
            break
    
for lst in itertools.combinations_with_replacement(p_lst, 2):
    ans.append(lst[0] * lst[1])
ans.sort()
print(ans[n - 1])