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 CountDiv(n):
    i = 1
    while True:
        if Func(i) == n:
            break
        i += 1
    return i
def Func(n):
    res = 0
    for i in range(1, int(n ** 0.5) + 1):
        if n % i == 0:
            res += 1
            if i * i != n:
                res += 1
    return res
print(CountDiv(int(input())))
