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 pri[15] = {2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47};
long long D, ans = 1000000000000000000LL;
void dfs(int pos, long long n, int d, int pre) {
  long long n2 = n;
  if (d == D) {
    ans = min(ans, n);
  }
  for (int i = 1; i <= pre; i++) {
    if (n2 > ans / pri[pos]) break;
    n2 *= pri[pos];
    if (D % (d * (i + 1)) == 0) dfs(pos + 1, n2, d * (i + 1), i);
  }
}
int main() {
  cin >> D;
  dfs(0, 1, 1, 100);
  cout << ans << endl;
  return 0;
}
