h(n)

Seonggwan is studying a function $h$ defined on the positive integers.

First, let $d(n)$ be the number of distinct positive divisors of $n$.

Then $h(n)$ is $n$ raised to the power $d(n)$, that is $h(n) = n^{d(n)}$.

For example, $d(6) = 4$, so $h(6) = 6^4 = 1296$.

Given an integer $n$, write a program that finds the smallest positive integer $x$ with $h(x) = n$.

The first line contains $n$ ($2 \le n \le 10^{18}$).

Print the smallest positive integer $x$ with $h(x) = n$ on the first line. If no such $x$ exists, print $-1$.