B. El GCD haywady Ashraf fe 7eta tanya
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output

Ashraf would love to tell you an interesting long story about some interesting topics but he is busy so here is the problem statement directly ^_^.

Given an integer $$$n$$$ determine if there are two integers $$$x$$$ and $$$y$$$ $$$(1 \lt x,y)$$$ such that $$$x+y=n$$$ and $$$gcd(x,y) \gt 1$$$.

Input

The first line of input consists of one integer $$$T$$$ $$$(1\leq{T}\leq{10})$$$ the number of test cases.

Each test case consists of an intger $$$n$$$ $$$(1\leq{n}\leq{10^{12}})$$$.

Output

Print $$$YES$$$ if there are valid $$$x$$$ and $$$y$$$ that their sum equal to $$$n$$$ and their $$$gcd$$$ greater than $$$1$$$ otherwise print $$$NO$$$.

Example
Input
3
14
5
35
Output
YES
NO
YES
Note

For the third testcase $$$35$$$ one valid answer is pair $$$(5, 30)$$$.