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;
unsigned long long prime[17] = {0,  2,  3,  5,  7,  11, 13, 17, 19,
                                23, 29, 31, 37, 41, 43, 47, 53};
unsigned long long ans = 1e19;
void dfs(unsigned long long i, unsigned long long num, unsigned long long temp,
         unsigned long long last) {
  if (i > 16 || num > n) return;
  if (num == n && ans > temp) ans = temp;
  unsigned long long tap = 1;
  for (int j = 1; j <= last; j++) {
    tap *= prime[i];
    dfs(i + 1, num * (j + 1), temp * tap, j);
  }
}
int main() {
  cin >> n;
  dfs(1, 1, 1, 64);
  cout << ans << endl;
  return 0;
}
