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;
mt19937 rng_32(chrono::steady_clock::now().time_since_epoch().count());
const int maxn = 2e5 + 10;
long long p[] = {2,  3,  5,  7,  11, 13, 17, 19, 23,
                 29, 31, 37, 41, 43, 47, 53, 59};
long long ans = 1e18 + 10;
long long n;
void dfs(int dep, int num, long long tmp, long long up) {
  if (dep > 16 || num > n) return;
  if (num == n) {
    ans = min(ans, tmp);
    return;
  }
  for (int i = 1; i <= up; i++) {
    if (tmp * p[dep] > ans) break;
    dfs(dep + 1, num * (i + 1ll), tmp *= p[dep], i);
  }
}
int main() {
  cin >> n;
  dfs(0, 1, 1, 60);
  cout << ans;
  return 0;
}
