time limit per test
2 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output
Lee is going to fashionably decorate his house for a party, using some regular convex polygons...
Lee thinks a regular nn-sided (convex) polygon is beautiful if and only if he can rotate it in such a way that at least one of its edges is parallel to the OXOX-axis and at least one of its edges is parallel to the OYOY-axis at the same time.
Recall that a regular nn-sided polygon is a convex polygon with nn vertices such that all the edges and angles are equal.
Now he is shopping: the market has tt regular polygons. For each of them print YES if it is beautiful and NO otherwise.
Input
The first line contains a single integer tt (1≤t≤1041≤t≤104) — the number of polygons in the market.
Each of the next tt lines contains a single integer nini (3≤ni≤1093≤ni≤109): it means that the ii-th polygon is a regular nini-sided polygon.
Output
For each polygon, print YES if it's beautiful or NO otherwise (case insensitive).
Example
input
Copy
4 3 4 12 1000000000
output
Copy
NO YES YES YES
Note
In the example, there are 44 polygons in the market. It's easy to see that an equilateral triangle (a regular 33-sided polygon) is not beautiful, a square (a regular 44-sided polygon) is beautiful and a regular 1212-sided polygon (is shown below) is beautiful as well.
解題說明：水題，判斷n是否爲4的倍數即可。
#include<stdio.h>
int main()
{
long long int t, n;
scanf("%lld", &t);
while (t--)
{
scanf("%lld", &n);
if (n % 4)
{
printf("NO\n");
}
else
{
printf("YES\n");
}
}
return 0;
}