E. Number With The Given Amount Of Divisorstime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputGiven 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.InputThe first line of the input contains integer n (1 ≤ n ≤ 1000).OutputOutput the smallest positive integer with exactly n divisors.ExamplesInput4Output6Input6Output12
Input4
Output6
['brute force', 'dp', 'number theory', '*2000']