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;
unsigned long long ans = (numeric_limits<unsigned long long>::max)();
;
int prime[16] = {2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53};
int n;
void core(int pos, unsigned long long k, int num) {
  if (num == n && ans > k) {
    ans = k;
    return;
  }
  for (int i = 1; i <= 63; i++) {
    k *= prime[pos];
    if (k > ans || num * (i + 1) > n) {
      return;
    }
    core(pos + 1, k, num * (i + 1));
  }
}
int main() {
  cin >> n;
  core(0, 1, 1);
  cout << ans << endl;
  return 0;
}
