Number With The Given Amount Of Divisors

Description:

Input:

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

Output:

Output the smallest positive integer with exactly n divisors.

Sample Input:

4

Sample Output:

6

Sample Input:

6

Sample Output:

12