Reduce to 1

Arun has an integer $N$. His friend likes the number $1$, so Arun wants to reduce $N$ to $1$. To do so, he can perform the following move several times (possibly, zero): - Pick two integers $X$ and $Y$ such that $X+Y$ is even and $X^Y$ is a divisor of $N$. Then, replace $N$ by $\dfrac{N}{X^Y}$ Note that at each step, $X^Y$ only needs to be a divisor of the *current* value of $N$, and not necessa