Divisor

Problem

Given a natural number N less than or equal to 12, find the smallest natural number such that the number of divisors is exactly N.

Constraints

• 1 ≤ N ≤ 12

Input

One natural number N is given in one line.

Output

Output the smallest natural number on a line so that the number of divisors is exactly N.

Examples

Input

1

Output

1

Input

2

Output

2

Input

3

Output

4

inputFormat

Input

One natural number N is given in one line.

outputFormat

Output

Output the smallest natural number on a line so that the number of divisors is exactly N.

Examples

Input

1

Output

1

Input

2

Output

2

Input

3

Output

4

样例

1

1