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 long long maxn = 1e18;
int p[30] = {1, 2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 47};
int a[100];
long long ans = maxn;
void dfs(int plc, int left) {
  if (left == 1) {
    double now = 1;
    long long aa = 1;
    for (int i = 1; i < plc; i++) now *= pow(p[i], a[i] - 1);
    if (now < ans) ans = (long long)now;
    return;
  }
  for (int i = 2; i <= left; i++)
    if (left % i == 0) {
      a[plc] = i;
      dfs(plc + 1, left / i);
    }
}
int main() {
  int n;
  scanf("%d", &n);
  dfs(1, n);
  printf("%lld\n", ans);
  return 0;
}
