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;
vector<unsigned long long> vecOfPrimes = {2,  3,  5,  7,  11, 13, 17, 19,
                                          23, 29, 31, 37, 41, 43, 47};
unsigned long long mn = 1e18, n;
void solve(int idx, unsigned long long num, int divs) {
  if (divs >= n) {
    if (divs == n) mn = min(mn, num);
    return;
  }
  for (int i = 1; i <= 64; i++) {
    if (num * vecOfPrimes[idx] > mn) return;
    solve(idx + 1, num *= vecOfPrimes[idx], divs * (i + 1));
  }
}
int main() {
  cin >> n;
  solve(0, 1, 1);
  cout << mn;
}
