#SDNU1483. Problem_A

Problem_A

Description

Check whether an integer nn is a power of 2.

Format

Input

First line contains a single integer T(T20000000)T (T \leq20000000) which denotes the number of test cases.
For each test case, there is an big integer N(0<N<21000)N(0 < N < 2^{1000})

Output

For each case, output the "YesYes" or "NoNo" in a single line.

Samples

3
1
3 
8
Yes
No
Yes