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
n=int(input())
p=[2, 3, 5, 7, 11, 13, 17, 19, 23, 29]
ans=int(1e19)
def calc(i, cur, val):
	global ans
	if cur == n:
		
		ans = min(ans, val)
		return
	if cur>n or i>10:
		return
	t = p[i]
	
	for j in range(1, 61):
		if ans >= t*val:
			calc(i+1, cur*(j+1), val*t)
		t = t*p[i]
calc(0,1,1)
print(ans);

