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 = 1e18;
const unsigned long long p[] = {2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31};
unsigned long long ans;
void dfs(unsigned long long now, unsigned long long res, unsigned long long dep,
         unsigned long long n) {
  if (res > n) return;
  if (res == n && ans > now) {
    ans = now;
    return;
  }
  for (int i = 1; i <= 64; i++) {
    if (now * p[dep] > ans) break;
    dfs(now *= p[dep], res * (i + 1), dep + 1, n);
  }
}
int main() {
  int n;
  while (scanf("%d", &n) != EOF) {
    ans = inf;
    dfs(1, 1, 0, n);
    printf("%I64u\n", ans);
  }
}
