Category
Similar Problems

0713. Factors

Time limit : 2000 ms
Memory limit : 64 mb

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

   Input

   One positive integer n (1 ≤ n ≤ 20).

   Output

   The smallest possible integer x, which has exactly n divisors.

Samples

№

Input

Output

1

2

 
2

2

4

 
6

3

5

 
16

4

6

 
12

 

Tayyorladi: Azat Yusupov
Text from: e-olimp.com