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 p[10] = {2, 3, 5, 7, 11, 13, 17, 19, 23, 29};
long long N, ans = 1e18;
void dfs(int i, long long x, long long n) {
  if (n > N) return;
  if (n == N && x < ans) ans = x;
  for (int j = 1; j <= 60; j++) {
    if (ans <= x * p[i]) return;
    dfs(i + 1, x *= p[i], n * (j + 1));
  }
}
int main() {
  cin >> N;
  dfs(0, 1, 1);
  cout << ans;
}
