e-olymp
favorite We need a little bit of your help to keep things running, click on this banner to learn more
Problems

Factors

Factors

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

Input

One positive integer n (1n16).

Output

The smallest possible integer x that has exactly n dividers.

Time limit 1 second
Memory limit 128 MiB
Input example #1
2
Output example #1
2
Input example #2
4
Output example #2
6
Input example #3
5
Output example #3
16
Source The 2012 All-Ukrainian Collegiate Programming Contest Round I Training Contest 19 April 2012