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;
long long prime[22] = {2,  3,  5,  7,  11, 13, 17, 19,
                       23, 29, 31, 37, 41, 43, 47, 53};
int n;
long long ans;
void dfs(int pos, long long tmp, long long num) {
  if (num > n) return;
  if (num == n && ans > tmp) {
    ans = tmp;
    return;
  }
  for (int i = 1; i <= 63; i++) {
    if (ans / prime[pos] < tmp) break;
    tmp *= prime[pos];
    dfs(pos + 1, tmp, num * (i + 1));
  }
}
int main() {
  ans = 0x7fffffffffffffff;
  scanf("%d", &n);
  dfs(0, 1, 1);
  printf("%I64d\n", ans);
  return 0;
}
