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 prim[] = {2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53}, n;
unsigned long long ans = ~(unsigned long long)0, tmp;
void Dfs(int i, unsigned long long v, int cnt) {
  if (cnt == n && ans > v) {
    ans = v;
    return;
  }
  for (int j = 1; j < 61; ++j) {
    tmp = v * prim[i];
    if (tmp < v || tmp > ans || cnt * (j + 1) > n) return;
    Dfs(i + 1, (v = tmp), cnt * (j + 1));
  }
}
int main() {
  scanf("%d", &n);
  Dfs(0, 1, 1);
  printf("%I64u\n", ans);
  return 0;
}
