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 .

输入描述:

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

输出描述:

Output the smallest positive integer with exactly n divisors.