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 int prime[] = {2,  3,  5,  7,  11, 13, 17, 19,
                         23, 29, 31, 37, 41, 43, 47, 53};
long long int ans, n;
void dfs(long long int cur_prime, long long int cur_num,
         long long int divisors) {
  if (divisors > n) return;
  if (divisors == n && ans > cur_num) ans = cur_num;
  for (long long int k = 1; k <= 60; k++) {
    if (cur_num > ans / prime[cur_prime]) break;
    cur_num = cur_num * prime[cur_prime];
    dfs(cur_prime + 1, cur_num, divisors * (k + 1));
  }
}
int main() {
  cin >> n;
  ans = 5e18;
  dfs(0, 1, 1);
  cout << ans;
}
