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>
const long long oo = 1000000000000000009;
const int p[] = {2, 3, 5, 7, 11, 13, 17, 19, 23, 29};
int n;
long long ans;
void dfs(int m, long long x, int i) {
  if (m > n) return;
  if (m == n && ans > x) {
    ans = x;
    return;
  }
  for (int j = 1; j < 64; j++) {
    if (ans / p[i] < x) break;
    dfs(m * (j + 1), x *= p[i], i + 1);
  }
}
int main() {
  while (scanf("%d", &n) != EOF) {
    ans = oo;
    dfs(1, 1, 0);
    printf("%lld\n", ans);
  }
  return 0;
}
