Description

Xiao Ming is studying recreational mathematics. If a positive integer has a binary representation that is a palindrome, Xiao Ming calls it a "brilliant number". For example, 33 in binary is 100001, so 33 is a brilliant number. Now, Xiao Ming has found T numbers and wants you to determine whether each of them is a brilliant number. Answer "Yes" if it is a brilliant number, otherwise answer "No".

Input Format

The first line inputs a number T, representing the count of numbers; followed by T lines, each line inputs a number to be checked.

Output Format

Output T lines, each containing a string "Yes" or "No", separated by spaces.

```input1 3 44 33 22 ``` ```output1 No Yes No ``` ## Hint

【Data Range】

For 100% of the data, 1 ≤ T ≤ 100000, 0 ≤ each number ≤ 10^9;

No solution available yetAC code

Source

CodesOnline