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 double eps = 1e-7;
struct pt {
  double x, y, z;
  pt(double x, double y, double z) : x(x), y(y), z(z){};
  pt(){};
};
long long rez = 1e18;
long long prime[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 calc(int ind, long long x, long long kol) {
  if (kol == n && x < rez) rez = x;
  for (int i = 1; i <= 70; ++i) {
    if (rez < x * prime[ind]) return;
    if (kol * i + 1 <= n) {
      calc(ind + 1, x * prime[ind], kol * (i + 1));
      x *= prime[ind];
    }
  }
}
int main() {
  cin >> n;
  calc(0, 1, 1);
  cout << rez;
}
