N = int(input())

def prime(x):
    prime = [True if x%2==1 else False for x in range(x+1)]
    prime[1] = False
    prime[2] = True

    for i in range(3, int(x**0.5)+2, 2):
        if prime[i]:
            for j in range(2*i, x+1, i):                
                prime[j] = False

    return prime

x = prime(10**5 + 100)
p = []
a = [1]
i = 10**5+1
for i in range(10**5+1, len(x)):
    if x[i]:
        p.append(i)

for i in range(len(p)-1):
    for j in range(i, len(p)):
        a.append(p[i]*p[j])
a.sort()
print(a[N-1])