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 int maxn = 503;
const double eps = 1e-12;
const long long mod = (1e7) + 7;
int p[16] = {2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53};
int n;
unsigned long long ans;
void dfs(int dep, unsigned long long temp, int num) {
  if (num > n) return;
  if (num == n && ans > temp) ans = temp;
  for (int i = 1; i <= 63; i++) {
    if (ans / p[dep] < temp) break;
    temp = temp * p[dep];
    dfs(dep + 1, temp, num * (i + 1));
  }
}
int main() {
  while (~scanf("%d", &n)) {
    ans = ((unsigned long long)1) << 63;
    dfs(0, 1, 1);
    cout << ans << endl;
  }
}
