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 primes[] = {2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41};
long long n;
long long solve(long long number_divisors, long long current_number,
                long long current_prime) {
  if (number_divisors == n) return current_number;
  long long res = 1e18;
  for (int power = 1;; power++) {
    current_number *= primes[current_prime];
    if ((number_divisors) * (power + 1) > n || current_number > res) break;
    res = min(res, solve((number_divisors) * (power + 1), current_number,
                         current_prime + 1));
  }
  return res;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin >> n;
  cout << solve(1, 1, 0) << endl;
  return 0;
}
