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[11] = {2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31};
int num[15], n;
long long ans;
void dfs(int x, long long int tmp, int t) {
  if (x == n && ans > tmp) ans = tmp;
  if (x > n) return;
  for (int i = 1; x * (i + 1) <= n && tmp * prime[t] < ans; i++) {
    tmp *= prime[t];
    dfs(x * (i + 1), tmp, t + 1);
  }
}
int main() {
  int i, j;
  while (cin >> n) {
    ans = 1111111111111111111ll;
    dfs(1, 1, 0);
    cout << ans << endl;
  }
  return 0;
}
