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 ans = 1000000000000000000;
int a[20], pri[20] = {2, 3, 5, 7, 11, 13, 17, 19, 23, 29}, n;
void solve(long long sum, int nw, int x) {
  if (nw > n) return;
  if (nw == n) {
    ans = min(ans, sum);
    return;
  }
  for (int i = 1; i < 100; i++) {
    if (ans / pri[x] < sum) break;
    solve(sum *= pri[x], nw * (i + 1), x + 1);
  }
}
int main() {
  cin >> n;
  solve(1, 1, 0);
  cout << ans;
  return 0;
}
