Diophantine Equation

Bikarp has the square of a positive integer $n^2$. He wants to split it into a sum of two cubes of positive integers. In other words, he wants to find positive integers $x$ and $y$ that solve the following Diophantine equation, where $n$ is fixed.

$n^2 = x^3 + y^3$

Find a solution, or determine that none exists.

The first line contains $T$, the number of test cases ($1 \le T \le 3000$). Each of the next $T$ lines contains a single integer $n$ ($1 \le n \le 10^9$).

Output $T$ lines. The $i$-th line contains the answer for the $i$-th test case: either "impossible" if $n$ cannot be decomposed, or two positive integers $x$ and $y$. If a test case has several solutions, output any of them.