题目描述
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
输入格式
见题面
输出格式
见题面
样例输入
1
样例输出
1