Problems
Divisors
Divisors
Find the smallest possible integer $x$, that has exactly $n$ divisors.
\InputFile
One positive integer $n~(1 \le n \le 16)$.
\OutputFile
Print the smallest possible integer $x$ that has exactly $n$ divisors.
Input example #1
2
Output example #1
2
Input example #2
4
Output example #2
6
Input example #3
5
Output example #3
16