# Game

Time limit: 2 seconds
## Problem

Alice and Bob play a game. There are n marbles. Alice and
Bob each take some marbles in turns. At each time,
a person can take at least 1 marbles and at most 2 marbles.
The one who take the last marble wins. Alice always
take marbles first. Given the integer n, is there a strategy
for Alice so that she can guarantee to win?

## Input

The input starts with an integer k <= 1,000 specifying the number
of test cases. Then k lines follow. In each line,
there is a single integer n, where 1 <= n <= 1,000,000.

## Output

For each test case, print "YES" if there is a strategy for
Alice to guarantee winning. Print "NO" otherwise.

## Sample Input

3
2
3
5

## Sample Output

YES
NO
YES

## Author

Chan Ho Leung