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
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>

using namespace std;

int main(){
	ios_base::sync_with_stdio(false);
	int n;
	cin >> n;
	int answer = 0;
	for(int i = 1; answer == 0; ++i){
		int c = 0;
		for(int j = 1; j * j <= i; ++j){
			if(i % j == 0){
				++c;
				if(j * j != i){ ++c; }
			}
		}
		if(c == n){ answer = i; }
	}
	cout << answer << endl;
	return 0;
}