Magic Stones Special Sequence

You are given a number of magic stones and your task is to decide whether it is possible to arrange these stones in a special sequence. A sequence is considered special if for every integer \( i \) in the range \(1 \le i < n\) (where \( n \) is the number of stones), the number \(2i+1\) is a prime number.

In other words, for a given \( n \) stones:

[ \text{For every } i \ (1 \le i < n), \quad 2i+1 \text{ must be a prime number.} ]

If \( n = 1 \), the sequence is trivially special. Otherwise, if any of the numbers \(2i+1\) is not prime, the arrangement is not possible.

Read the input from stdin and output your answer to stdout.

inputFormat

The first line of input contains a single integer \(T\) — the number of test cases.
Each of the following \(T\) lines contains one integer \(n\) which represents the number of magic stones.

Input is provided via stdin.

outputFormat

For each test case, print a single line containing either YES if it is possible to arrange the stones in the special sequence, or NO otherwise.

Output should be written to stdout.

## sample

3
4
5
3

YES
NO
YES

</p>