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 double eps = 1E-8;
const int dx4[4] = {1, 0, 0, -1};
const int dy4[4] = {0, -1, 1, 0};
const int inf = 0x3f3f3f3f;
int prime[] = {2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47};
int n;
long long ans = 1LL << 60;
void dfs(int depth, long long val, int num) {
  if (num > n) return;
  if (num == n && val < ans) ans = val;
  for (int i = 1; i <= 63; i++) {
    if (val * prime[depth] > ans) break;
    dfs(depth + 1, val *= prime[depth], num * (i + 1));
  }
}
int main() {
  cin >> n;
  dfs(0, 1, 1);
  cout << ans << endl;
  return 0;
}
