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 long long N = 2e5 + 30, Mod = 1e9 + 7;
const long long SQ = 330;
long long ans = 1e18, md, n;
long long p[] = {1, 2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53};
inline void bt(long long x, long long L, long long t, long long m) {
  if (t == n and m != 0) ans = min(ans, m);
  if (x > 13) return;
  long long k = 1;
  for (int i = 1; i <= L; i++) {
    k *= p[x];
    if (1e18 / m < k or t > n) continue;
    bt(x + 1, i, t * (i + 1), m * k);
  }
}
int main() {
  ios::sync_with_stdio(0), cin.tie(0);
  cin >> n;
  bt(1, 60, 1, 1);
  cout << ans;
  return (0);
}
