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 inf = 0x3f3f3f3f;
const long long inff = 0x3f3f3f3f3f3f3f3f;
const int mod = 998244353;
unsigned long long n, ans = ~0ULL;
const int prime[16] = {2,  3,  5,  7,  11, 13, 17, 19,
                       23, 29, 31, 37, 41, 43, 47, 53};
void dfs(unsigned long long depth, unsigned long long tmp,
         unsigned long long num, unsigned long long up) {
  if (num > n || depth >= 16) return;
  if (num == n && ans > tmp) {
    ans = tmp;
    return;
  }
  for (int i = (1); i <= (int)(up); ++i) {
    if (tmp > ans / prime[depth]) break;
    dfs(depth + 1, tmp *= prime[depth], num * (i + 1), i);
  }
}
int main() {
  scanf("%llu", &n);
  dfs(0, 1, 1, 64);
  printf("%llu\n", ans);
  return 0;
}
