Problem: 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 Format: The first line of the input contains integer n (1 ≤ n ≤ 1000).
Output Format: Output the smallest positive integer with exactly n divisors.