Phoenix and Puzzle

题意翻译

输入一个数 $ n $ $ (1 \le n \le 10^9) $，求能否使用 $ n $ 个全等的等腰直角三角形来**拼成**一个正方形。**要求每个三角形都必须使用。** 本题共有 $ t $ $ (1 \le t \le 10^4) $ 组数据。对于每组数据，若能满足上述要求则输出`YES`，否则输出`NO`。

题目描述

Phoenix is playing with a new puzzle, which consists of $ n $ identical puzzle pieces. Each puzzle piece is a right isosceles triangle as shown below. A puzzle pieceThe goal of the puzzle is to create a square using the $ n $ pieces. He is allowed to rotate and move the pieces around, but none of them can overlap and all $ n $ pieces must be used (of course, the square shouldn't contain any holes as well). Can he do it?

输入输出格式

输入格式

The input consists of multiple test cases. The first line contains an integer $ t $ ( $ 1 \le t \le 10^4 $ ) — the number of test cases. The first line of each test case contains an integer $ n $ ( $ 1 \le n \le 10^9 $ ) — the number of puzzle pieces.

输出格式

For each test case, if Phoenix can create a square with the $ n $ puzzle pieces, print YES. Otherwise, print NO.

输入输出样例

输入样例 #1

3
2
4
6

输出样例 #1

YES
YES
NO

说明

For $ n=2 $ , Phoenix can create a square like this: For $ n=4 $ , Phoenix can create a square like this: For $ n=6 $ , it is impossible for Phoenix to create a square.