C. Consecutive Numbers
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output

"Captain Teemo on duty!"

"Hut two three four" Perhaps Teemo loves consecutive numbers as many people do.

Tristana, as a lover of consecutive numbers (and also Teemo), asked you $$$Q$$$ questions. For each question, you have to determine whether the given number $$$X$$$ can be represented as a sum of at least two consecutive positive integers. For example, the answer for $$$X=9$$$ is Yes as $$$9=2+3+4$$$ while the answer for $$$2$$$ is No (note that $$$(-1)+0+1+2=2$$$ is invalid as only positive integers are allowed).

Input

The first line contains a single integer, $$$Q$$$, denoting the number of questions Timo asked ($$$1\le Q\le 10^5$$$).

In each of the next $$$Q$$$ lines, a positive integer $$$X$$$ is given ($$$1\le X\le 10^9$$$).

Output

For each of the $$$Q$$$ questions, print the answer in a single line: either Yes or No.

Example
Input
6
1
2
10
20
100
200
Output
No
No
Yes
Yes
Yes
Yes