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>
int n;
long long res = LLONG_MAX;
int primes[] = {2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53};
void dfs(long long cur, long long num, int up, int pos) {
  if (num > n) return;
  if (pos > 15) return;
  if (num == n) {
    if (cur < res) res = cur;
    return;
  }
  for (int i = 1; i <= up; i++) {
    if (cur > res) break;
    dfs(cur = cur * primes[pos], num * (i + 1), i, pos + 1);
  }
}
int main(void) {
  scanf("%d", &n);
  dfs(1, 1, 64, 0);
  printf("%lld\n", res);
  return 0;
}
