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>
const int T[] = {2, 3, 5, 7, 11, 13, 17, 19, 23, 29};
void search(int i, int n, long long v, long long& r) {
  if (10 <= i || n <= 1) {
    if (n == 1 && v < r) r = v;
  } else {
    long long b(1);
    for (int j(1); 0 < b * v && b * v < r && j <= n; b *= T[i], ++j) {
      if (n % j == 0) search(i + 1, n / j, b * v, r);
    }
  }
}
int main() {
  int n;
  long long r(1LL << 62);
  ;
  std::scanf("%d", &n);
  search(0, n, 1, r);
  std::cout << r << std::endl;
  return 0;
}
