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;
const int Maxn = 1000;
const int p[] = {2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47};
const long long INF = 0x3f3f3f3f3f3f3f3f;
int N;
long long ans;
void DFS(int pos, long long val, long long num) {
  if (num > N || pos > 15) return;
  if (num == N) {
    ans = min(ans, val);
    return;
  }
  for (int i = 1; i <= 70; 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));
  }
}
int main() {
  scanf("%d", &N);
  ans = INF;
  DFS(0, 1, 1);
  printf("%lld\n", ans);
  return 0;
}
