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;
int D;
long long ans;
int p[] = {2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37};
long long cnt;
void dfs(int leftd, int pos, long long d, int n) {
  cnt++;
  long long d2 = d;
  if (n == D) {
    ans = min(ans, d);
    return;
  }
  for (int i = 1; i <= leftd; ++i) {
    if (d2 > ans / p[pos]) break;
    d2 *= p[pos];
    if (D % (n * (i + 1)) == 0) dfs(i, pos + 1, d2, n * (i + 1));
  }
}
int main() {
  cin >> D;
  ans = 2e18;
  dfs(100, 0, 1, 1);
  cout << ans << endl;
  return 0;
}
