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[16] = {2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53};
int n;
unsigned long long ans = ULLONG_MAX;
void dfs(int deep, unsigned long long num, long long sum) {
  if (sum == n) ans = min(num, ans);
  for (int i = 1; i <= 1000; i++) {
    if (num * prime[deep] > ans || sum * (i + 1) > n) break;
    dfs(deep + 1, num * prime[deep], sum * (i + 1));
    num *= prime[deep];
  }
}
int main() {
  cin >> n;
  dfs(0, 1, 1);
  cout << ans << endl;
}
