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 prime[] = {1,  2,  3,  5,  7,  11, 13, 17, 19,
                              23, 29, 31, 37, 41, 43, 47, 53, 59};
int n;
unsigned long long ans;
void dfs(unsigned long long dept, unsigned long long num,
         unsigned long long tmp) {
  if (num > n || dept > 17 || (ans != -1 && tmp > ans) || tmp < 0) return;
  if (num == n) {
    if (ans == -1)
      ans = tmp;
    else
      ans = ans < tmp ? ans : tmp;
  }
  for (int i = 1; i <= 64 && tmp < 1e18; i++) {
    if (num * (i + 1) > n) break;
    tmp *= prime[dept];
    dfs(dept + 1, num * (i + 1), tmp);
  }
}
int main() {
  while (~scanf("%d", &n)) {
    ans = -1;
    dfs(1, 1, 1);
    printf("%lld\n", ans);
  }
}
