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;
long long f[10] = {2, 3, 5, 7, 11, 13, 17, 19, 23, 29};
int N = 0;
long long res = 1e18;
void dfs(int idx, long long x, int n) {
  if (n > N) {
    return;
  }
  if (n == N && res > x) {
    res = x;
  }
  for (int i = 1; i <= 60; ++i) {
    if (x * f[idx] > res) {
      return;
    }
    x *= f[idx];
    dfs(idx + 1, x, n * (i + 1));
  }
}
int main() {
  scanf("%d", &N);
  dfs(0, 1, 1);
  cout << res << endl;
  return 0;
}
