CF1515B.Phoenix and Puzzle

普及/提高-

通过率：0%

AC君温馨提醒

该题目为【codeforces】题库的题目，您提交的代码将被提交至codeforces进行远程评测，并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供，我们无法保证该服务的稳定性，若提交后无反应，请等待一段时间后再进行重试。

题目描述

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.

首页