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 inf = 0x3f3f3f3f;
long long dict[] = {2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53};
long long n;
long long ans;
void dfs(long long k, long long sum, long long cnt) {
  if (cnt > n) return;
  if (cnt == n) {
    ans = min(ans, sum);
  }
  long long t = 1;
  for (long long i = 1; i <= 64; i++) {
    if (sum > ans / dict[k]) break;
    dfs(k + 1, sum *= dict[k], cnt * (i + 1));
  }
}
int main() {
  while (scanf("%I64d", &n) != EOF) {
    ans = 1000000000000000000;
    dfs(0, 1, 1);
    printf("%I64d\n", ans);
  }
  return 0;
}
