Magnus and Hikaru, the top two blitz and rapid chess players in the world got bored after playing regular chess. So, they decided to come up with a new game.
They have a chessboard of dimensions N*N. Initially, the board is empty.
In each turn, the player who's playing places a knight such that it cannot be killed by any of the knights that are already there on the board. Both players take turns alternatively.
A knight that is present at (x,y) can kill any other knight if it is present at:
(x+2, y+1)
(x+2, y-1)
(x-2, y+1)
(x-2, y-1)
(x+1, y+2)
(x+1, y-2)
(x-1, y+2)
(x-1, y-2)
At any point, if either Magnus or Hikaru cannot make a move they lose.
After playing some games, Magnus figured out the optimal strategy. Output “YES” (without quotes) if Magnus has to go first or "NO" if he should let Hikaru go first such that Magnus always wins.
Input format:
The first line contains an integer T (1 <= T <= 104) - the number of test cases
The only line of each test case contains N (1 <= N <= 109) - the size of the chessboard.
Output format:
For each test case output "YES" or "NO" in a new line depending on whether Magnus should go first or not.
In the first test case, there is only one square on the board. So, after Magnus places a knight there, Hikaru doesn't have any move to make.
In the second test case, it can be proved that Magnus always loses if he goes first, so he has to let Hikaru go first.
