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 INF = 1e18;
int p[16] = {2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53};
long long res;
int n;
void dfs(int pos, long long num, int d, int top) {
  if (d > n) return;
  if (d == n) {
    res = min(res, num);
    return;
  }
  for (int i = 1; i <= top; i++) {
    if (num <= INF / p[pos])
      num *= p[pos];
    else
      break;
    dfs(pos + 1, num, d * (i + 1), i);
  }
}
int main(void) {
  scanf("%d", &n);
  res = 1ll << 62;
  dfs(0, 1, 1, 62);
  printf("%lld\n", res);
  return 0;
}
