import math

def is_prime(n):
    if n == 1: return False

    for k in range(2, int(math.sqrt(n)) + 1):
        if n % k == 0:
            return False

    return True

n=int(input())
if(n==1):
    print(1)
else:
    
    i=0
    pri=[]
    pris=[]
    x=10**5
    while(i<9):
        x+=1
        if(is_prime(
            x)==True):
            pri.append(x)
            i+=1
    for i in range(9):
        for j in range(i,8):
            p=pri[i]*pri[j]
            pris.append(p)
    pris.sort()
    print(pris[n-2])