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;
unsigned long long n, ans = 1e18;
unsigned long long prime[] = {0,  2,  3,  5,  7,  11, 13, 17, 19,
                              23, 29, 31, 37, 41, 43, 47, 53};
void dfs(unsigned long long num, unsigned long long pr, unsigned long long cf,
         unsigned long long all) {
  if (num > ans) return;
  if (all > n) return;
  if (pr > 15) return;
  if (all == n) {
    ans = num;
    return;
  }
  for (unsigned long long i = 1; i <= cf; ++i) {
    num *= prime[pr];
    dfs(num, pr + 1, i, all * (i + 1));
  }
  return;
}
signed main() {
  scanf("%llu", &n);
  dfs(1, 1, 64, 1);
  printf("%llu\n", ans);
  return 0;
}
