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[] = {2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53};
int N;
long long ans;
void dfs(int dept, long long tmp, int num) {
  if (num > N) return;
  if (num == N) {
    ans = min(ans, tmp);
    return;
  }
  for (int i = 1; i <= 64; ++i) {
    if (ans / prime[dept] <= tmp) break;
    tmp *= prime[dept];
    dfs(dept + 1, tmp, num * (i + 1));
  }
}
int main() {
  scanf("%d", &N);
  ans = LLONG_MAX;
  dfs(0, 1, 1);
  printf("%I64d", ans);
  return 0;
}
