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;
unsigned long long n, ans;
int p[16] = {2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53};
void DFS(int pos, unsigned long long val, unsigned long long num) {
  if (num > n || pos > 15) return;
  if (num == n) {
    ans = min(ans, val);
    return;
  }
  for (int i = 1; i <= 63; i++) {
    if (val > ans / p[pos] || num * (i + 1) > n) break;
    val *= p[pos];
    if (n % (num * (i + 1)) == 0) DFS(pos + 1, val, num * (i + 1));
  }
  return;
}
int main() {
  while (~scanf("%d", &n)) {
    ans = 1ull << 63;
    DFS(0, 1, 1);
    cout << ans << endl;
  }
}
