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 1018.

Input

The first line of the input contains integer n (1 ≤ n ≤ 1000).

Output

Output the smallest positive integer with exactly n divisors.

Examples

Input

4


Output

6


Input

6


Output

12
p = [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47]

def calc(idx, x, dv):
    global ans
    if dv > n:
        return
    if dv == n and x < ans:
        ans = x

    for pw in range(2, 61):
        if x*p[idx] > ans:
            return
        x *= p[idx]
        calc(idx+1, x, dv*pw)


n = int(input())
ans = 10**18
calc(0, 1, 1)
print(ans)