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 unsigned long long INF = ~0ull;
int prime[19] = {0,  2,  3,  5,  7,  11, 13, 17, 19, 23,
                 29, 31, 33, 37, 41, 43, 47, 53, 57};
int prime_nums[19] = {2 << 6, 0};
void dfs(int depth, int cnt, unsigned long long num, int& n,
         unsigned long long& ans) {
  if (cnt > n) return;
  if (cnt == n) {
    ans = min(ans, num);
  }
  for (int i = 1; i <= prime_nums[depth - 1]; i++) {
    if (num > (unsigned long long)1e18) break;
    prime_nums[depth] = i;
    num *= prime[depth];
    dfs(depth + 1, cnt * (i + 1), num, n, ans);
  }
  prime_nums[depth] = 0;
}
int main() {
  int n;
  while (~scanf("%d", &n)) {
    unsigned long long ans = INF;
    dfs(1, 1, 1, n, ans);
    printf("%lld\n", ans);
  }
}
