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 long long MAXN = 1e18;
int pri[13] = {2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41};
long long ans;
int n;
void dfs(int k, int cnt, long long val) {
  long long cur = 1;
  for (int i = 1; i < 63; i++) {
    if (cnt * (i + 1) > n) return;
    cur = cur * pri[k];
    if (cur * val >= ans)
      return;
    else if (cnt * (i + 1) == n) {
      ans = cur * val;
      return;
    } else
      dfs(k + 1, cnt * (i + 1), cur * val);
  }
}
int main() {
  scanf("%d", &n);
  ans = MAXN;
  if (n == 1)
    cout << 1 << endl;
  else {
    dfs(0, 1, 1);
    cout << ans << endl;
  }
  return 0;
}
