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 MOD = 1e9 + 7;
const int MAXN = 1e5 + 5;
const long long LNF = 9e18;
const int INF = 1e9 + 10;
long long p[] = {2,  3,  5,  7,  11, 13, 17, 19, 23, 29, 31, 37, 41,
                 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97};
long long ans, n;
void dfs(int pos, long long res, long long num) {
  if (num > n) return;
  if (num == n && ans > res) {
    ans = res;
    return;
  }
  for (int i = (1), b_ = (63); i <= b_; ++i) {
    if (ans / p[pos] < res) break;
    res *= p[pos];
    dfs(pos + 1, res, num * (i + 1));
  }
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  ans = LNF;
  cin >> n;
  dfs(0, 1, 1);
  cout << ans << endl;
  return 0;
}
