CF27E.Number With The Given Amount Of Divisors

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.

给定正整数 $n$，求恰好有 $n$ 个正因数的最小正整数。题目保证对于给定的 $n$，答案不超过 $10^{18}$。

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

输入的第一行包含一个整数 $n$（$1 \leq n \leq 1000$）。

Output the smallest positive integer with exactly n divisors.

输出恰好有 $n$ 个正因数的最小正整数。