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 unsigned long long INF = ~0ll;
unsigned long long prime[16] = {2,  3,  5,  7,  11, 13, 17, 19,
                                23, 29, 31, 37, 41, 43, 47, 53};
int n;
unsigned long long ans;
void dfs(int deepth, unsigned long long v, unsigned long long num) {
  if (num > n || deepth > 15) return;
  if (num == n && v < ans) {
    ans = v;
    return;
  }
  for (unsigned long long i = 1; i <= 63; i++) {
    if (ans / prime[deepth] < v) break;
    dfs(deepth + 1, v *= prime[deepth], num * (i + 1));
  }
}
int main() {
  while (cin >> n) {
    ans = INF;
    dfs(0, 1, 1);
    cout << ans << endl;
  }
  return 0;
}
