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