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
#!/usr/bin/env python

p = [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31]
n = int(raw_input())
ans = 10 ** 20

def dfs(now, num, x):
	global ans, n
	if num == n:
		ans = min(now, ans)
	if num < n:
		for i in range(1, 65):
			if now * p[x] > ans:
				return
			else:
				now = now * p[x]
				dfs(now, num * (i + 1), x + 1)

dfs(1, 1, 0)
print ans
  		 	 		   	 	 	    		  		  	