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;
int n;
long long int ans;
long long int a[] = {0, 2, 3, 5, 7, 11, 13, 17, 19, 23, 29};
void f(long long int v, int sum, int p) {
  if (sum > n) return;
  if (sum == n) {
    if (v < ans) ans = v;
    return;
  }
  for (int i = 1; i <= 60; i++) {
    v *= a[p];
    if (v >= ans) break;
    f(v, sum * (i + 1), p + 1);
  }
}
int main() {
  scanf("%d", &n);
  ans = 1e18;
  f(1ll, 1, 1);
  printf("%lld\n", ans);
  return 0;
}
