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 int p[] = {2, 3, 5, 7, 11, 13, 17, 19, 23, 29};
int n;
long long ans = numeric_limits<long long>::max();
void dfs(int depth, long long cur, int index) {
  if (depth > n) return;
  if (depth == n) {
    ans = fmin(ans, cur);
    return;
  }
  for (int i = 1; i <= 64; ++i) {
    if (ans / p[index] < cur) break;
    dfs(depth * (i + 1), cur *= p[index], index + 1);
  }
}
int main() {
  scanf("%d", &n);
  dfs(1, 1, 0);
  printf("%lld\n", ans);
}
