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;
long long rez = 1e18;
long long easy[20] = {2,  3,  5,  7,  11, 13, 17, 19, 23, 29,
                      31, 37, 41, 43, 47, 53, 59, 61, 67, 71};
long long N;
void f(int i, long long x, long long n) {
  if (n > N) return;
  if (n == N && x < rez) rez = x;
  for (int j = 1; j <= 70; j++) {
    if (rez < x * easy[i]) return;
    f(i + 1, x *= easy[i], n * (j + 1));
  }
}
int main() {
  cin >> N;
  f(0, 1, 1);
  cout << rez << "\n";
}
