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).
m = int(input())
n, k = 0, 0
while k != m:
    i, k = 1, 0
    n += 1
    while i*i < n+1:
        if n%i == 0:
            #print(i,n//i)
            if n//i != i :
                k += 2
            else :
                k+=1
        i+=1
print(n)