Problem Statement

Given a positive integer $n$, determine whether a square can be divided into $n$ smaller squares (not necessarily of equal size). Output "Yes" or "No" to indicate whether such a division is possible. Multiple test cases are provided.

A division is defined as making a single cut, but the cut must be a straight line whose endpoints lie either on the boundary of the square or on previously made cuts.

Input Format

The first line contains a positive integer $T$, the number of test cases.

Each of the next $T$ lines contains a positive integer $n$.

Constraints: $1 \leq T \leq 10^5$, $1 \leq n \leq 10^9$.

Output Format

For each test case, output a single line with "Yes" or "No" indicating whether such a division is possible.

The output can be in any case-insensitive form (e.g., "yEs", "yes", "Yes", and "YES" are all acceptable).

Sample #1

Sample Input #1

3
4
3
256

Sample Output #1

Yes
No
Yes

Hint

Explanation for Sample #1

• A square cannot be divided into exactly $3$ smaller squares.
• Since $4 = 2^2$ and $256 = 16^2$, both can be divided into several congruent smaller squares.