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())
p = [2, 3, 5, 7, 11, 13, 17, 19, 23]

def f(n, sig):
    if n == 1:
        return 1
    actual = 10**20
    for i in range(2, n + 1):
        if n % i == 0:
            actual = min(actual, p[sig] ** (i - 1) * f(n // i, sig + 1))
    return actual
 
print(f(n, 0))
