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>
unsigned long long p[16] = {2,  3,  5,  7,  11, 13, 17, 19,
                            23, 29, 31, 37, 41, 43, 47, 53};
unsigned long long ans;
unsigned long long n;
void dfs(unsigned long long depth, unsigned long long temp,
         unsigned long long num, unsigned long long up) {
  if (num > n || depth >= 16) return;
  if (num == n && ans > temp) {
    ans = temp;
    return;
  }
  for (int i = 1; i <= up; i++) {
    if (temp > ans) break;
    dfs(depth + 1, temp = temp * p[depth], num * (i + 1), i);
  }
}
int main() {
  while (scanf("%llu", &n) != EOF) {
    ans = ~0ULL;
    dfs(0, 1, 1, 64);
    printf("%llu\n", ans);
  }
  return 0;
}
