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;
const long long INF = 1e18 + 5;
long long prime[] = {2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31};
long long ans = INF, n;
void f(long long i, long long j, long long x) {
  if (j > n) {
    return;
  }
  if (j == n && x < ans) {
    ans = x;
    return;
  }
  for (long long k = 1; k <= 64; k++) {
    if (ans <= x * prime[i]) return;
    f(i + 1, j * (k + 1), x *= prime[i]);
  }
}
signed main() {
  cin >> n;
  f(0, 1, 1);
  cout << ans;
}
