Divisors

Very easy

Execution time limit is 1 second

Runtime memory usage limit is 128 megabytes

Find the smallest possible integer $x$ , that has exactly $n$ divisors.

Input

One positive integer $n (1 \leq n \leq 16)$ .

Print the smallest possible integer $x$ that has exactly $n$ divisors.

Input #1

Answer #1

Input #2

Answer #2

Input #3

Answer #3

Submissions 2K

Acceptance rate 50%