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;
int prime[] = {1, 2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37}, a[20];
long long ans = 1e18;
inline double qpow(double x, long long y) {
  double res = 1;
  while (y) {
    if (y & 1) res *= x;
    x *= x;
    y >>= 1;
  }
  return res;
}
void dfs(int x, int now) {
  if (now == 1) {
    double res = 1;
    for (int i = 1; i < x; i++) res = res * qpow(prime[i], a[i] - 1);
    if (res <= 1e18) ans = min(ans, (long long)res);
    return;
  }
  for (int i = now; i >= 2; i--)
    if (now % i == 0) a[x] = i, dfs(x + 1, now / i);
}
int main() {
  int n;
  scanf("%d", &n);
  dfs(1, n);
  printf("%lld\n", ans);
  return 0;
}
