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