Given the number n, find the smallest positive integer which has exactly n divisors. It is guaranteed that for the given n the answer will not exceed 1018.

Input

The first line of the input contains integer n (1 ≤ n ≤ 1000).

Output

Output the smallest positive integer with exactly n divisors.

Examples

Input

4


Output

6


Input

6


Output

12
#include <bits/stdc++.h>
using namespace std;
const int dir[4][2] = {{-1, 0}, {0, 1}, {1, 0}, {0, -1}};
const int mx[8] = {-1, -2, -2, -1, 1, 2, 2, 1};
const int my[8] = {-2, -1, 1, 2, 2, 1, -1, -2};
const double eps = 1e-6;
const double PI = acos(-1.0);
const int maxn = 100005;
const unsigned long long inf = ~0ULL;
unsigned long long prime[16] = {2,  3,  5,  7,  11, 13, 17, 19,
                                23, 29, 31, 37, 41, 43, 47, 53};
int n;
unsigned long long ans;
void dfs(int dep, int cnt, int up, unsigned long long now) {
  if (dep == 16 || cnt > n) return;
  if (cnt == n && ans > now) {
    ans = now;
    return;
  }
  for (int i = 1; i <= up; ++i) {
    if (ans / prime[dep] < now) break;
    dfs(dep + 1, cnt * (i + 1), i, now *= prime[dep]);
  }
}
int main() {
  while (cin >> n) {
    ans = inf;
    dfs(0, 1, 64, 1ULL);
    cout << ans << endl;
  }
  return 0;
}
