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
import sys
from array import array  # noqa: F401


def input():
    return sys.stdin.buffer.readline().decode('utf-8')


n = int(input())
primes = [2, 3, 5, 7, 11, 13, 17, 19, 23, 29]


def rec(x, i):
    res = primes[i]**(x - 1)
    for j in range(2, x):
        if x % j == 0:
            res = min(res, primes[i]**(x // j - 1) * rec(j, i + 1))

    return res


print(rec(n, 0))
