Find the smallest positive integer x that has exactly n divisors.
One positive integer n (1 \le n \le 16).
Print the smallest positive integer x that has exactly n divisors.
Ejemplo 1
Ejemplo 2
Ejemplo 3
