Madame Mischievous works for a law firm named 'Digo Easyman' headed by Digo. Mischievous is brilliant at his work so Digo wants to promote her now.He decides to play a game with her to test him for the last time.They both sit on a table with 'n' number of coins.Now,he wants her to start first and pick up k number of checkers from the table where k can be only a power of 2(eg-1,2,4,8..).The first person to fall short of any coin to pick is the loser.Given the number of coins on the table initially,find if both play optimally, weather Mischievous will get promoted or not.

Input: First line contains t. t test cases followed by 'n',the number of coins placed on the table.

Output: YES if Mischievous gets promoted and NO if he doesn't.