You are given a positive integer $x$. Check whether the number $x$ is representable as the sum of the cubes of two positive integers.

Formally, you need to check if there are two integers $a$ and $b$ ($1 \le a, b$) such that $a^3+b^3=x$.

For example, if $x = 35$, then the numbers $a=2$ and $b=3$ are suitable ($2^3+3^3=8+27=35$). If $x=4$, then no pair of numbers $a$ and $b$ is suitable.

Input

The first line contains one integer $t$ ($1 \le t \le 100$) — the number of test cases. Then $t$ test cases follow.

Each test case contains one integer $x$ ($1 \le x \le 10^{12}$).

Please note, that the input for some test cases won't fit into $32$-bit integer type, so you should use at least $64$-bit integer type in your programming language.

Output

For each test case, output on a separate line:

• "YES" if $x$ is representable as the sum of the cubes of two positive integers.
• "NO" otherwise.

You can output "YES" and "NO" in any case (for example, the strings yEs, yes, Yes and YES will be recognized as positive).

见题面 Input 部分

见题面 Output 部分

The number $1$ is not representable as the sum of two cubes.

The number $2$ is represented as $1^3+1^3$.

The number $4$ is not representable as the sum of two cubes.

The number $34$ is not representable as the sum of two cubes.

The number $35$ is represented as $2^3+3^3$.

The number $16$ is represented as $2^3+2^3$.

The number $703657519796$ is represented as $5779^3+7993^3$.