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).
def divisors(n):
    c=0
    for i in range(1,n+1):
        if(n%i==0):
            c+=1 
    return c

n=int(input())
for j in range(1,10001):
    d=divisors(j)
    if(d==n):
        print(j)
        break