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 prime[10] = {2, 3, 5, 7, 11, 13, 17, 19, 23, 29};
unsigned long long f[20][1010];
unsigned long long maxx = 1e18;
int n;
int main() {
  cin >> n;
  if (n == 1) {
    printf("1\n");
    return 0;
  }
  for (int i = 0; i <= 10; i++)
    for (int j = 1; j <= n; j++) f[i][j] = maxx;
  f[0][1] = 1;
  for (int i = 0; i < 10; i++)
    for (int j = 1; j <= n; j++) {
      unsigned long long temp = f[i][j];
      int k = j + j;
      while ((double)temp * prime[i] <= maxx && k <= n) {
        temp *= prime[i];
        f[i + 1][k] = min(f[i + 1][k], temp);
        k += j;
      }
    }
  unsigned long long ans = maxx;
  for (int i = 1; i <= 10; i++) ans = min(ans, f[i][n]);
  cout << ans << endl;
}
