Given the number *n*, find the smallest positive integer which has exactly *n* divisors. It is guaranteed that for the given *n* the answer will not exceed 10<sup class="upper-index">18</sup>.
The first line of the input contains integer *n* (1 ≤ *n* ≤ 1000).
n=int(input())

pr=[]
d=[2,3,5,7,11,13,17,19,23,29]

k=2
m=n
while k*k<=m:
    while m%k==0:
        pr.append(k)
        m=m//k
    k+=1
if m>1:
    pr.append(m)

res=1


for i in range(len(pr)):
    res=res*(d[i]**(pr[len(pr)-1-i]-1))

print(res)
    
