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<long long> vec, primes;
long long arr[12] = {2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37},
          ans = LONG_LONG_MAX, n, tmp;
void fn(long long ind, long long val, long long c) {
  if (c > n) return;
  if (c == n) {
    ans = min(ans, val);
    return;
  }
  if (ind == 12) return;
  for (long long i = 0; i <= 60; i++) {
    if (val <= 0 || val > 1000000000000000000) break;
    fn(ind + 1, val, c * (i + 1));
    val *= arr[ind];
  }
  return;
}
int main() {
  cin >> n;
  fn(0, 1, 1);
  cout << ans << "\n";
  return 0;
}
