Problems

# Factors

# Factors

Find the smallest possible integer **x**, that has exactly **n** dividers.

#### Input

One positive integer **n** (**1** ≤ **n** ≤ **16**).

#### Output

The smallest possible integer **x** that has exactly **n** dividers.

Input example #1

2

Output example #1

2

Input example #2

4

Output example #2

6

Input example #3

5

Output example #3

16