Let's introduce a two-player game, table tennis, where a winner is always decided and draws are impossible.
Three players, Sosai, Fofo, and Hohai, want to spend the rest of their lives playing table tennis. They decided to play forever in the following way:
Now, the players, fully immersed in this infinite loop of matches, have tasked you with solving the following problem:
Given an integer $$$k$$$, determine whether the spectator of the first match can be the spectator in the $$$k$$$-th match.
Each test contains multiple test cases. The first line contains the number of test cases $$$t$$$ ($$$1 \le t \le 1000$$$). The description of the test cases follows.
The only line of each test case contains one integer $$$k$$$ ($$$1 \le k \le 10^9$$$).
For each test case, print "YES" (without quotes) if the spectator of the first match can be the spectator of the $$$k$$$-th match, and "NO" (without quotes) otherwise.
You can output the answer in any case (upper or lower). For example, the strings "yEs", "yes", "Yes", and "YES" will be recognized as positive responses.
4123331000000000
YES NO NO YES
In the first test case, the spectator of the first match is already a spectator in the $$$1$$$st match.
In the second test case, the spectator of the first match will play in the $$$2$$$nd match regardless of the result of the first match.