Number With The Given Amount Of Divisors

给定一个正整数n，输出最小的整数，满足这个整数有n个因子

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 $ 10^{18} $ .

The first line of the input contains integer $ n $ ( $ 1<=n<=1000 $ ).

Output the smallest positive integer with exactly $ n $ divisors.

4

6

6

12