Lee is going to fashionably decorate his house for a party, using some regular convex polygons...

Lee thinks a regular $n$-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 $OX$-axis and at least one of its edges is parallel to the $OY$-axis at the same time.

Recall that a regular $n$-sided polygon is a convex polygon with $n$ vertices such that all the edges and angles are equal.

Now he is shopping: the market has $t$ regular polygons. For each of them print YES if it is beautiful and NO otherwise.


-----Input-----

The first line contains a single integer $t$ ($1 \le t \le 10^4$) — the number of polygons in the market. 

Each of the next $t$ lines contains a single integer $n_i$ ($3 \le n_i \le 10^9$): it means that the $i$-th polygon is a regular $n_i$-sided polygon. 


-----Output-----

For each polygon, print YES if it's beautiful or NO otherwise (case insensitive).


-----Example-----
Input
4
3
4
12
1000000000

Output
NO
YES
YES
YES



-----Note-----

In the example, there are $4$ polygons in the market. It's easy to see that an equilateral triangle (a regular $3$-sided polygon) is not beautiful, a square (a regular $4$-sided polygon) is beautiful and a regular $12$-sided polygon (is shown below) is beautiful as well. [Image]

Source: codeforces | Difficulty: EASY
Tags: Geometry

Mathematics


Solutions:
import time
from collections import deque

def inpt():
	return int(input())

def inpl():
	return list(map(int, input().split()))

def inpm():
	return map(int, input().split())

def solve():
	n = inpt()
	if n % 4 == 0:
		print('YES')
	else:
		print('NO')

def main():
	m = 10 ** 9 + 7
	t = int(input())
	while t:
		t -= 1
		solve()
main()


for _ in range(int(input())):
	n = int(input())
	if n / 2 % 2 == 0:
		print('Yes')
	else:
		print('No')


def beapoly(n):
	if n > 0 and n % 4 == 0:
		print('YES')
	else:
		print('NO')
for i in range(int(input())):
	beapoly(int(input()))


def solve():
	n = int(input())
	if n % 4 == 0:
		print('YES')
	else:
		print('NO')
t = int(input())
for x in range(t):
	solve()


import heapq

def read_list():
	return list(map(int, input().strip().split(' ')))

def print_list(l):
	print(' '.join(map(str, l)))
N = int(input())
for _ in range(N):
	n = int(input())
	if n % 4 == 0:
		print('YES')
	else:
		print('NO')


tc = int(input())
for i in range(tc):
	a = int(input())
	if a % 4 == 0:
		print('YES')
	else:
		print('NO')


t = int(input())
for _ in range(t):
	n = int(input())
	x = (n - 4) % 4
	if x != 0:
		print('NO')
	else:
		print('YES')


from math import *
from copy import *
from string import *
from random import *
from sys import stdin, stdout
from sys import maxsize
from operator import *
from itertools import *
from collections import Counter
import math
import math
import time
from queue import Queue

def seive(n):
	l = [True]
	l = l * (n + 1)
	for i in range(2, int(sqrt(n)) + 1):
		if l[i] == True:
			val = i * i
			while val < len(l):
				l[val] = False
				val += i
	prime = []
	for i in range(2, len(l)):
		if l[i] == True:
			prime.append(i)
	return prime

def dp(l, i, n, val, ans):
	if i >= n or val < 0:
		return 1000000
	elif val == 0:
		return 0
	else:
		if ans[i] == 1000000:
			ans[i] = min(min(1 + dp(l, i + 1, n, val - l[i], ans), 1 + dp(l, i, n, val - l[i], ans)), dp(l, i + 1, n, val, ans))
		return ans[i]
from queue import Queue

def factors(n):
	l = []
	for i in range(1, int(sqrt(n)) + 1):
		if n % i == 0:
			if n // i == i:
				l.append(i)
			else:
				l.append(i)
				l.append(n // i)
	return l

def check1(s, v, x):
	while True:
		if v not in s:
			return v
		else:
			v -= 1

def check2(s, v, x):
	while True:
		if v not in s:
			return v
		else:
			v += 1

def up(n):
	j = n - 1
	while j > 0:
		if n % j == 0:
			break
		j -= 1
	return j
t = int(input())
for i in range(t):
	n = int(input())
	if n % 4 == 0:
		print('YES')
	else:
		print('NO')


import sys
import math
from sys import stdin, stdout

def get_ints():
	return map(int, sys.stdin.readline().strip().split())

def get_list():
	return list(map(int, sys.stdin.readline().strip().split()))

def get_string():
	return sys.stdin.readline().strip()

def main():
	for t in range(int(input())):
		n = int(input())
		if n % 4 == 0:
			print('YES')
		else:
			print('NO')
py2 = round(0.5)
if py2:
	from future_builtins import ascii, filter, hex, map, oct, zip
	range = xrange
import os, sys
from io import IOBase, BytesIO
BUFSIZE = 8192

class FastIO(BytesIO):
	newlines = 0

	def __init__(self, file):
		self._file = file
		self._fd = file.fileno()
		self.writable = 'x' in file.mode or 'w' in file.mode
		self.write = super(FastIO, self).write if self.writable else None

	def _fill(self):
		s = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
		self.seek((self.tell(), self.seek(0, 2), super(FastIO, self).write(s))[0])
		return s

	def read(self):
		while self._fill():
			pass
		return super(FastIO, self).read()

	def readline(self):
		while self.newlines == 0:
			s = self._fill()
			self.newlines = s.count(b'\n') + (not s)
		self.newlines -= 1
		return super(FastIO, self).readline()

	def flush(self):
		if self.writable:
			os.write(self._fd, self.getvalue())
			(self.truncate(0), self.seek(0))

class IOWrapper(IOBase):

	def __init__(self, file):
		self.buffer = FastIO(file)
		self.flush = self.buffer.flush
		self.writable = self.buffer.writable
		if py2:
			self.write = self.buffer.write
			self.read = self.buffer.read
			self.readline = self.buffer.readline
		else:
			self.write = lambda s: self.buffer.write(s.encode('ascii'))
			self.read = lambda : self.buffer.read().decode('ascii')
			self.readline = lambda : self.buffer.readline().decode('ascii')
(sys.stdin, sys.stdout) = (IOWrapper(sys.stdin), IOWrapper(sys.stdout))
input = lambda : sys.stdin.readline().rstrip('\r\n')
main()


n = int(input())
for _ in range(n):
	s = int(input())
	if s % 4 == 0:
		print('YES')
	else:
		print('NO')


for k in range(int(input())):
	i = int(input())
	if i % 4 == 0:
		print('YES')
	else:
		print('NO')


import math
for x in range(int(input())):
	n = int(input())
	if n % 4 == 0:
		print('YES')
	else:
		print('NO')


for w in [*open(0)][1:]:
	print('YNEOS'[int(w) % 4 > 0::2])


from sys import stdin, setrecursionlimit, stdout
from collections import deque
from math import sqrt, floor, ceil, log, log2, log10, pi, gcd, sin, cos, asin
from heapq import heapify, heappop, heappush, heappushpop, heapreplace

def ii():
	return int(stdin.readline())

def fi():
	return float(stdin.readline())

def mi():
	return map(int, stdin.readline().split())

def fmi():
	return map(float, stdin.readline().split())

def li():
	return list(mi())

def si():
	return stdin.readline().rstrip()

def lsi():
	return list(si())
mod = 1000000007
res = ['Yes', 'No']
test_case = ii()
while test_case:
	test_case -= 1
	n = ii()
	f = 1
	if not n % 4:
		f = 0
	print(res[f])


t = int(input())
for i in range(t):
	sides = int(input())
	if sides % 4 == 0:
		print('YES')
	else:
		print('NO')


t = int(input())
tuple1 = []
for i in range(t):
	a = int(input())
	if a // 4 == a / 4:
		tuple1.append('YES')
	else:
		tuple1.append('NO')
for i in tuple1:
	print(i)


from sys import stdin, stdout
from math import gcd, sqrt, floor, ceil
input = stdin.readline

def list_inp(x):
	return list(map(x, input().split()))

def map_inp(x):
	return map(x, input().split())

def lcm(a, b):
	return a * b / gcd(a, b)
t = int(input())
for _ in range(t):
	n = int(input())
	if n % 4 == 0:
		print('YES')
	else:
		print('NO')


def fashionablee(n):
	if n % 4 == 0:
		return 'YES'
	return 'NO'
test = int(input())
for i in range(test):
	n = int(input())
	print(fashionablee(n))


t = int(input())
for u in range(t):
	n = int(input())
	if n % 4 == 0:
		print('YES')
	else:
		print('NO')


def main():
	x = int(input())
	for i in range(x):
		n = int(input())
		if n % 4 == 0 and n != 0:
			print('YES')
		else:
			print('NO')
main()


T = int(input())
arr = [int(input()) for _ in range(T)]
for x in arr:
	print('YES' if x % 4 == 0 else 'NO')


for _ in range(int(input())):
	n = int(input())
	if n % 4 == 0 and n > 2:
		print('YES')
	else:
		print('NO')


import os
import sys
from io import BytesIO, IOBase

def solve():
	for i in range(int(input())):
		n = int(input())
		if n % 4 == 0:
			print('YES')
		else:
			print('NO')

def main():
	solve()
	pass
BUFSIZE = 8192

class FastIO(IOBase):
	newlines = 0

	def __init__(self, file):
		self._fd = file.fileno()
		self.buffer = BytesIO()
		self.writable = 'x' in file.mode or 'r' not in file.mode
		self.write = self.buffer.write if self.writable else None

	def read(self):
		while True:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
			if not b:
				break
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines = 0
		return self.buffer.read()

	def readline(self):
		while self.newlines == 0:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
			self.newlines = b.count(b'\n') + (not b)
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines -= 1
		return self.buffer.readline()

	def flush(self):
		if self.writable:
			os.write(self._fd, self.buffer.getvalue())
			(self.buffer.truncate(0), self.buffer.seek(0))

class IOWrapper(IOBase):

	def __init__(self, file):
		self.buffer = FastIO(file)
		self.flush = self.buffer.flush
		self.writable = self.buffer.writable
		self.write = lambda s: self.buffer.write(s.encode('ascii'))
		self.read = lambda : self.buffer.read().decode('ascii')
		self.readline = lambda : self.buffer.readline().decode('ascii')
(sys.stdin, sys.stdout) = (IOWrapper(sys.stdin), IOWrapper(sys.stdout))
input = lambda : sys.stdin.readline().rstrip('\r\n')
main()


n = int(input())
answer = ''
for i in range(0, n):
	polygon = int(input())
	if polygon % 4 == 0:
		answer = answer + 'YES\n'
	else:
		answer = answer + 'NO\n'
print(answer)


t = eval(input(''))
for i in range(t):
	n = eval(input(''))
	if n % 4 == 0:
		print('YES')
	else:
		print('NO')


from sys import stdin, stdout
from fractions import Fraction
for _ in range(int(stdin.readline())):
	n = int(stdin.readline())
	ext = Fraction(360, n)
	if 360 // n > 90 or Fraction(90) % ext:
		print('NO')
	else:
		print('YES')


import math
num = int(input())
for i in range(num):
	n = int(input())
	if n % 4 == 0:
		print('YES')
	else:
		print('NO')


from collections import Counter, defaultdict
BS = '0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ'

def to_base(s, b):
	res = ''
	while s:
		res += BS[s % b]
		s //= b
	return res[::-1] or '0'
alpha = 'abcdefghijklmnopqrstuvwxyz'
from math import floor, ceil, pi
primes = [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97, 101, 103, 107, 109, 113, 127, 131, 137, 139, 149, 151, 157, 163, 167, 173, 179, 181, 191, 193, 197, 199, 211, 223, 227, 229, 233, 239, 241, 251, 257, 263, 269, 271, 277, 281, 283, 293, 307, 311, 313, 317, 331, 337, 347, 349, 353, 359, 367, 373, 379, 383, 389, 397, 401, 409, 419, 421, 431, 433, 439, 443, 449, 457, 461, 463, 467, 479, 487, 491, 499, 503, 509, 521, 523, 541, 547, 557, 563, 569, 571, 577, 587, 593, 599, 601, 607, 613, 617, 619, 631, 641, 643, 647, 653, 659, 661, 673, 677, 683, 691, 701, 709, 719, 727, 733, 739, 743, 751, 757, 761, 769, 773, 787, 797, 809, 811, 821, 823, 827, 829, 839, 853, 857, 859, 863, 877, 881, 883, 887, 907, 911, 919, 929, 937, 941, 947, 953, 967, 971, 977, 983, 991, 997, 1009, 1013, 1019, 1021, 1031, 1033, 1039, 1049, 1051, 1061, 1063, 1069, 1087, 1091, 1093, 1097, 1103, 1109, 1117, 1123, 1129, 1151, 1153, 1163, 1171, 1181, 1187, 1193, 1201, 1213, 1217, 1223, 1229, 1231, 1237, 1249, 1259, 1277, 1279, 1283, 1289, 1291, 1297, 1301, 1303, 1307, 1319, 1321, 1327, 1361, 1367, 1373, 1381, 1399, 1409, 1423, 1427, 1429, 1433, 1439, 1447, 1451, 1453, 1459, 1471, 1481, 1483, 1487, 1489, 1493, 1499, 1511, 1523, 1531, 1543, 1549, 1553, 1559, 1567, 1571, 1579, 1583, 1597, 1601, 1607, 1609, 1613, 1619, 1621, 1627, 1637, 1657, 1663, 1667, 1669, 1693, 1697, 1699, 1709, 1721, 1723, 1733, 1741, 1747, 1753, 1759, 1777, 1783, 1787, 1789, 1801, 1811, 1823, 1831, 1847, 1861, 1867, 1871, 1873, 1877, 1879, 1889, 1901, 1907, 1913, 1931, 1933, 1949, 1951, 1973, 1979, 1987, 1993, 1997, 1999, 2003, 2011, 2017, 2027, 2029, 2039, 2053, 2063, 2069, 2081, 2083, 2087, 2089, 2099, 2111, 2113, 2129, 2131, 2137, 2141, 2143, 2153, 2161, 2179, 2203, 2207, 2213, 2221, 2237, 2239, 2243, 2251, 2267, 2269, 2273, 2281, 2287, 2293, 2297, 2309, 2311, 2333, 2339, 2341, 2347, 2351, 2357, 2371, 2377, 2381, 2383, 2389, 2393, 2399, 2411, 2417, 2423, 2437, 2441, 2447, 2459, 2467, 2473, 2477, 2503, 2521, 2531, 2539, 2543, 2549, 2551, 2557, 2579, 2591, 2593, 2609, 2617, 2621, 2633, 2647, 2657, 2659, 2663, 2671, 2677, 2683, 2687, 2689, 2693, 2699, 2707, 2711, 2713, 2719, 2729, 2731, 2741, 2749, 2753, 2767, 2777, 2789, 2791, 2797, 2801, 2803, 2819, 2833, 2837, 2843, 2851, 2857, 2861, 2879, 2887, 2897, 2903, 2909, 2917, 2927, 2939, 2953, 2957, 2963, 2969, 2971, 2999, 3001, 3011, 3019, 3023, 3037, 3041, 3049, 3061, 3067, 3079, 3083, 3089, 3109, 3119, 3121, 3137, 3163, 3167, 3169, 3181, 3187, 3191, 3203, 3209, 3217, 3221, 3229, 3251, 3253, 3257, 3259, 3271, 3299, 3301, 3307, 3313, 3319, 3323, 3329, 3331, 3343, 3347, 3359, 3361, 3371, 3373, 3389, 3391, 3407, 3413, 3433, 3449, 3457, 3461, 3463, 3467, 3469, 3491, 3499, 3511, 3517, 3527, 3529, 3533, 3539, 3541, 3547, 3557, 3559, 3571, 3581, 3583, 3593, 3607, 3613, 3617, 3623, 3631, 3637, 3643, 3659, 3671, 3673, 3677, 3691, 3697, 3701, 3709, 3719, 3727, 3733, 3739, 3761, 3767, 3769, 3779, 3793, 3797, 3803, 3821, 3823, 3833, 3847, 3851, 3853, 3863, 3877, 3881, 3889, 3907, 3911, 3917, 3919, 3923, 3929, 3931, 3943, 3947, 3967, 3989, 4001, 4003, 4007, 4013, 4019, 4021, 4027, 4049, 4051, 4057, 4073, 4079, 4091, 4093, 4099, 4111, 4127, 4129, 4133, 4139, 4153, 4157, 4159, 4177, 4201, 4211, 4217, 4219, 4229, 4231, 4241, 4243, 4253, 4259, 4261, 4271, 4273, 4283, 4289, 4297, 4327, 4337, 4339, 4349, 4357, 4363, 4373, 4391, 4397, 4409, 4421, 4423, 4441, 4447, 4451, 4457, 4463, 4481, 4483, 4493, 4507, 4513, 4517, 4519, 4523, 4547, 4549, 4561, 4567, 4583, 4591, 4597, 4603, 4621, 4637, 4639, 4643, 4649, 4651, 4657, 4663, 4673, 4679, 4691, 4703, 4721, 4723, 4729, 4733, 4751, 4759, 4783, 4787, 4789, 4793, 4799, 4801, 4813, 4817, 4831, 4861, 4871, 4877, 4889, 4903, 4909, 4919, 4931, 4933, 4937, 4943, 4951, 4957, 4967, 4969, 4973, 4987, 4993, 4999, 5003, 5009, 5011, 5021, 5023, 5039, 5051, 5059, 5077, 5081, 5087, 5099, 5101, 5107, 5113, 5119, 5147, 5153, 5167, 5171, 5179, 5189, 5197, 5209, 5227, 5231, 5233, 5237, 5261, 5273, 5279, 5281, 5297, 5303, 5309, 5323, 5333, 5347, 5351, 5381, 5387, 5393, 5399, 5407, 5413, 5417, 5419, 5431, 5437, 5441, 5443, 5449, 5471, 5477, 5479, 5483, 5501, 5503, 5507, 5519, 5521, 5527, 5531, 5557, 5563, 5569, 5573, 5581, 5591, 5623, 5639, 5641, 5647, 5651, 5653, 5657, 5659, 5669, 5683, 5689, 5693, 5701, 5711, 5717, 5737, 5741, 5743, 5749, 5779, 5783, 5791, 5801, 5807, 5813, 5821, 5827, 5839, 5843, 5849, 5851, 5857, 5861, 5867, 5869, 5879, 5881, 5897, 5903, 5923, 5927, 5939, 5953, 5981, 5987, 6007, 6011, 6029, 6037, 6043, 6047, 6053, 6067, 6073, 6079, 6089, 6091, 6101, 6113, 6121, 6131, 6133, 6143, 6151, 6163, 6173, 6197, 6199, 6203, 6211, 6217, 6221, 6229, 6247, 6257, 6263, 6269, 6271, 6277, 6287, 6299, 6301, 6311, 6317, 6323, 6329, 6337, 6343, 6353, 6359, 6361, 6367, 6373, 6379, 6389, 6397, 6421, 6427, 6449, 6451, 6469, 6473, 6481, 6491, 6521, 6529, 6547, 6551, 6553, 6563, 6569, 6571, 6577, 6581, 6599, 6607, 6619, 6637, 6653, 6659, 6661, 6673, 6679, 6689, 6691, 6701, 6703, 6709, 6719, 6733, 6737, 6761, 6763, 6779, 6781, 6791, 6793, 6803, 6823, 6827, 6829, 6833, 6841, 6857, 6863, 6869, 6871, 6883, 6899, 6907, 6911, 6917, 6947, 6949, 6959, 6961, 6967, 6971, 6977, 6983, 6991, 6997, 7001, 7013, 7019, 7027, 7039, 7043, 7057, 7069, 7079, 7103, 7109, 7121, 7127, 7129, 7151, 7159, 7177, 7187, 7193, 7207, 7211, 7213, 7219, 7229, 7237, 7243, 7247, 7253, 7283, 7297, 7307, 7309, 7321, 7331, 7333, 7349, 7351, 7369, 7393, 7411, 7417, 7433, 7451, 7457, 7459, 7477, 7481, 7487, 7489, 7499, 7507, 7517, 7523, 7529, 7537, 7541, 7547, 7549, 7559, 7561, 7573, 7577, 7583, 7589, 7591, 7603, 7607, 7621, 7639, 7643, 7649, 7669, 7673, 7681, 7687, 7691, 7699, 7703, 7717, 7723, 7727, 7741, 7753, 7757, 7759, 7789, 7793, 7817, 7823, 7829, 7841, 7853, 7867, 7873, 7877, 7879, 7883, 7901, 7907, 7919]

def primef(n, plst=[]):
	if n == 1:
		return plst
	else:
		for m in primes:
			if n % m == 0:
				return primef(n // m, plst + [m])
		return primef(1, plst + [n])
t = int(input())
for i in range(t):
	n = int(input())
	if n % 4 == 0:
		print('YES')
	else:
		print('NO')


t = int(input())
for test in range(t):
	n = int(input())
	if n == 0:
		print('NO')
	elif n % 4 == 0:
		print('YES')
	else:
		print('NO')


import sys
input = sys.stdin.readline
t = int(input())
for _ in range(t):
	n = int(input())
	print('YES' if n % 4 == 0 else 'NO')


for _ in range(int(input())):
	print('NO' if int(input()) % 4 else 'YES')


t = int(input())
for test in range(t):
	n = int(input())
	if n % 4 == 0:
		print('Yes')
	else:
		print('No')


for i in range(int(input())):
	n = int(input())
	print(['NO', 'YES'][n % 4 == 0])


for i in range(int(input())):
	n = int(input())
	if 90 * n % 360 == 0:
		print('YES')
	else:
		print('NO')


import math
import collections
from sys import stdin, stdout, setrecursionlimit
from bisect import bisect_left as bsl
from bisect import bisect_right as bsr
import heapq as hq
setrecursionlimit(2 ** 20)
t = 1
t = int(stdin.readline())
for _ in range(t):
	n = int(stdin.readline())
	tmp = (n - 2) * 180
	tmp = tmp / n
	tmp = 180 - tmp
	if n % 4 == 0:
		print('YES')
	else:
		print('NO')


testcase = int(input())
answer = []
while testcase != 0:
	n = int(input())
	if n % 4 == 0:
		answer.append('YES')
	else:
		answer.append('NO')
	testcase -= 1
for i in answer:
	print(i)


import sys
from bisect import *
from math import floor, sqrt, ceil, factorial as F, gcd, pi
from itertools import chain, combinations, permutations, accumulate
from collections import Counter, defaultdict, OrderedDict, deque
from array import array
INT_MAX = sys.maxsize
INT_MIN = -sys.maxsize - 1
mod = 1000000007
ch = 'abcdefghijklmnopqrstuvwxyz'
lcm = lambda a, b: a * b // gcd(a, b)
setbit = lambda x: bin(x)[2:].count('1')
input = lambda : sys.stdin.readline()

def solve():
	n = int(sys.stdin.readline())
	for _ in range(n):
		a = int(sys.stdin.readline())
		print('YES' if not a % 4 else 'NO')
try:
	sys.stdin = open('input.txt', 'r')
	sys.stdout = open('output.txt', 'w')
except:
	pass
solve()


from sys import stdin, stdout
from sys import maxsize

def solve():
	pass
test = 1
test = int(input())
for t in range(0, test):
	n = int(input())
	if n % 4 == 0:
		print('YES')
	else:
		print('NO')
	ans = solve()


import math as mt

def tran(n):
	p = n - 4
	if p / 4 == int(p / 4):
		return 'YES'
	else:
		return 'NO'
t = int(input())
ans = []
for i in range(t):
	n = int(input())
	r = tran(n)
	ans.append(r)
for i in ans:
	print(i)


import sys
input = sys.stdin.readline
for f in range(int(input())):
	if int(input()) % 4 == 0:
		print('YES')
	else:
		print('NO')


t = int(input())
import math
for i in range(t):
	q = int(input())
	if q % 4 == 0:
		print('YES')
	else:
		print('NO')


a = int(input())
b = 0
while b < a:
	c = int(input())
	if c % 4 == 0:
		print('YES')
	else:
		print('NO')
	b = b + 1


t = int(input())
for i in range(t):
	n = int(input())
	if n % 4 == 0:
		print('yes')
	else:
		print('no')


def ans(s):
	if s % 4 == 0:
		return 'YES'
	return 'NO'
t = int(input())
for _ in range(t):
	s = int(input())
	print(ans(s))


t = int(input())
while t > 0:
	t = t - 1
	a = int(input())
	if a % 4 == 0:
		print('YES')
	else:
		print('NO')


import sys

def ii():
	return sys.stdin.readline().strip()

def idata():
	return [int(x) for x in ii().split()]

def solve():
	n = int(ii())
	if n % 4 == 0:
		print('YES')
	else:
		print('NO')
	return
for t in range(int(ii())):
	solve()


N = int(input())
c = 0
for h in range(N):
	a = int(input())
	if a % 4 == 0:
		print('YES')
	else:
		print('NO')


import sys
input = sys.stdin.buffer.readline

def solution():
	for _ in range(int(input())):
		n = int(input())
		if n % 4 == 0:
			print('YES')
		else:
			print('NO')
solution()


def main():
	t = int(input())
	while t:
		n = int(input())
		if n % 4 == 0:
			print('YES')
		else:
			print('NO')
		t -= 1
main()


from collections import Counter
from collections import defaultdict
from collections import deque
import math
import heapq
import sys
import io, os
input = sys.stdin.readline
from bisect import *
rs = lambda : input().strip()
ri = lambda : int(input())
rl = lambda : list(map(int, input().strip().split()))
rls = lambda : list(map(str, input().split()))
t = int(input())
for _ in range(0, t):
	n = int(input())
	if n % 4 == 0:
		print('YES')
	else:
		print('NO')


for _ in range(int(input())):
	n = int(input())
	if n % 4 == 0:
		print('Yes')
	else:
		print('no')


from sys import stdin
A = int(stdin.readline())
for t in range(0, A):
	B = int(stdin.readline())
	if B % 4 == 0:
		print('YES')
	else:
		print('NO')


test_case = int(input())
for i in range(test_case):
	value = int(input())
	if value % 2 == 0 and value // 2 % 2 == 0:
		print('YES')
	else:
		print('NO')


from sys import stdin, stdout
for query in range(int(stdin.readline())):
	if int(stdin.readline()) % 4 == 0:
		stdout.write('YES\n')
	else:
		stdout.write('NO\n')


n = int(input())
for i in range(n):
	l = int(input())
	if l % 4 == 0:
		print('YES')
	else:
		print('NO')


from sys import stdin, stdout
for test in range(int(stdin.readline())):
	n = int(stdin.readline())
	if n % 4 == 0:
		print('YES')
	else:
		print('NO')


t11 = int(input())
for _ in range(t11):
	a = int(input())
	if a % 4 == 0:
		print('YES')
	else:
		print('NO')


t = int(input())
for i in range(t):
	n = int(input())
	if n % 4:
		print('NO')
	else:
		print('YES')


import sys
tests = int(sys.stdin.readline().split()[0])
for test in range(tests):
	n = int(sys.stdin.readline().split()[0])
	if n % 4 == 0:
		print('YES')
	else:
		print('NO')


import sys
import math
input = sys.stdin.readline
from collections import deque
from queue import LifoQueue
for _ in range(int(input())):
	n = int(input())
	if n % 4 == 0:
		print('YES')
	else:
		print('NO')


import sys
reader = (s.rstrip() for s in sys.stdin)
input = reader.__next__
t = int(input())
for _ in range(t):
	n = int(input())
	print('YES' if n % 4 == 0 else 'NO')


n = int(input(''))
list = []
for i in range(n):
	list.append(int(input('')))
for i in range(n):
	if list[i] > 3 and list[i] % 4 == 0:
		print('YES')
	else:
		print('NO')


import sys

def input():
	return sys.stdin.readline().rstrip()

def input_split():
	return [int(i) for i in input().split()]
testCases = int(input())
answers = []
for _ in range(testCases):
	n = int(input())
	if n % 4 == 0:
		answers.append('YES')
	else:
		answers.append('NO')
print(*answers, sep='\n')


for _ in range(int(input())):
	a = int(input())
	print(['NO', 'YES'][a % 4 == 0])


t = int(input())
p = []
for i in range(t):
	n = int(input())
	if n % 4 == 0:
		p.append('YES')
	else:
		p.append('NO')
print(*p, sep='\n')


t = int(input())
answer = []
for a in range(t):
	n = int(input())
	if n % 4 == 0:
		answer.append('YES')
	else:
		answer.append('NO')
for b in answer:
	print(b)


t = int(input())
from fractions import Fraction
for case in range(t):
	n = int(input())
	internal_angle = Fraction(360, n)
	if 90 % internal_angle == 0 and (90 / internal_angle).numerator < n:
		print('YES')
	else:
		print('NO')


import math

def check(t, h, c, n):
	return abs(t - (n * (h + c) - c) / (2 * n - 1))
li = []

def fact(n):
	sumy = n
	a = 1
	b = n
	for i in range(1, int(n ** (1 / 2)) + 1):
		if n % i == 0 and sumy > i + n / i:
			a = i
			b = n // i
			sumy = a + b
	if b == n:
		li.append(b)
		return
	fact(a)
	fact(b)

def solution():
	n = int(input())
	if n % 4 == 0:
		print('YES')
	else:
		print('NO')
for _ in range(int(input())):
	solution()


def help():
	n = int(input())
	if 90 * n % 360 == 0:
		print('YES')
	else:
		print('NO')
for _ in range(int(input())):
	help()


t = int(input())
for i in range(t):
	n = int(input())
	if n & 1:
		print('NO')
	else:
		n -= 4
		if (n == 0 or n >= 4) and n / 2 % 2 == 0:
			print('YES')
		else:
			print('NO')


def solve(N):
	if N % 4 == 0:
		print('YES')
	else:
		print('NO')
t = int(input())
while t != 0:
	n = int(input())
	solve(n)
	t -= 1


n = int(input())
stack = []
for i in range(n):
	a = int(input())
	if a % 4 == 0:
		stack.append('YES')
	else:
		stack.append('NO')
for j in range(len(stack)):
	print(stack[j])


from math import sqrt, floor, ceil
for _ in range(int(input())):
	n = int(input())
	if n % 4 == 0:
		print('Yes')
	else:
		print('No')


def gcd(a, b):
	if b == 0:
		return a
	else:
		return gcd(b, a % b)
T = int(input())
for i in range(0, T):
	n = int(input())
	l = gcd(n, 2 * n - 4)
	a = n
	b = 2 * n - 4
	a = int(a / l)
	b = int(b / l)
	if b % 2 != 0:
		if a < n:
			print('YES')
	else:
		print('NO')


import os
import sys
from io import BytesIO, IOBase
import math
from decimal import *
from collections import defaultdict
getcontext().prec = 25
MOD = pow(10, 9) + 7
BUFSIZE = 8192

class FastIO(IOBase):
	newlines = 0

	def __init__(self, file):
		self._fd = file.fileno()
		self.buffer = BytesIO()
		self.writable = 'x' in file.mode or 'r' not in file.mode
		self.write = self.buffer.write if self.writable else None

	def read(self):
		while True:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
			if not b:
				break
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines = 0
		return self.buffer.read()

	def readline(self):
		while self.newlines == 0:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
			self.newlines = b.count(b'\n') + (not b)
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines -= 1
		return self.buffer.readline()

	def flush(self):
		if self.writable:
			os.write(self._fd, self.buffer.getvalue())
			(self.buffer.truncate(0), self.buffer.seek(0))

class IOWrapper(IOBase):

	def __init__(self, file):
		self.buffer = FastIO(file)
		self.flush = self.buffer.flush
		self.writable = self.buffer.writable
		self.write = lambda s: self.buffer.write(s.encode('ascii'))
		self.read = lambda : self.buffer.read().decode('ascii')
		self.readline = lambda : self.buffer.readline().decode('ascii')
(sys.stdin, sys.stdout) = (IOWrapper(sys.stdin), IOWrapper(sys.stdout))
input = lambda : sys.stdin.readline().rstrip('\r\n')
for _ in range(int(input())):
	n = int(input())
	if n % 4:
		print('NO')
	else:
		print('YES')


for z in range(int(input())):
	n = int(input())
	if n % 4 == 0:
		print('YES')
	else:
		print('NO')


t = int(input())
while t:
	t += -1
	n = int(input())
	if n % 4:
		print('NO')
	else:
		print('YES')


t = eval(input())
for _ in range(t):
	s = eval(input())
	if s % 4 == 0:
		print('YES')
	else:
		print('NO')


numquery = int(input())
while numquery > 0:
	numquery -= 1
	n = int(input())
	if n % 4 > 0:
		print('NO')
	else:
		print('YES')


t = int(input())
la = []
for i in range(t):
	i = int(input())
	if i % 4 == 0:
		la.append('YES')
	else:
		la.append('NO')
for r in la:
	print(r)


def main():
	t = int(input())
	ans = []
	for i in range(t):
		n = int(input())
		if n % 2 == 0:
			if n // 2 % 2 == 0:
				ans.append('YES')
			else:
				ans.append('NO')
		else:
			ans.append('NO')
	for i in ans:
		print(i)
main()


def main():
	for _ in range(int(input())):
		x = int(input())
		if x % 4 == 0:
			print('YES')
		else:
			print('NO')
main()


def f():
	n = int(input(''))
	if n % 4 == 0:
		print('YES')
	else:
		print('NO')
n = int(input(''))
for i in range(n):
	f()


T = int(input())

def main():
	x = int(input())
	if x % 4 == 0:
		return 'YES'
	else:
		return 'NO'
for i in range(T):
	print(main())


from array import array
from math import log

def solve(a, b, c, d, n):
	if (a - b) * n > c + d or (a + b) * n < c - d:
		return 'No'
	return 'Yes'
test_cases = int(input())
for i in range(test_cases):
	(n,) = input().split(' ')
	n = int(n)
	if n % 4 == 0:
		print('YES')
	else:
		print('NO')


def solve():
	n = 0
	n = int(input())
	if n % 2 == 1:
		return 'NO'
	if n / 2 % 2 == 1:
		return 'NO'
	else:
		return 'YES'
k = int(input())
for _ in range(k):
	k = solve()
	print(k)
	pass
pass


def solve(n):
	if n % 4 == 0:
		return 'YES'
	else:
		return 'NO'

def main():
	T = int(input())
	for _ in range(T):
		print(solve(int(input())))
main()


t = int(input())
cases = []
for i in range(t):
	cases.append(int(input()))
for case in cases:
	print('YES' if case % 4 == 0 else 'NO')


n = int(input())
for x in range(n):
	a = int(input())
	if a % 4 == 0:
		print('YES')
	else:
		print('NO')


import sys
reader = (s.rstrip() for s in sys.stdin)
input = reader.__next__

def gift():
	for _ in range(t):
		n = int(input())
		if n % 4:
			yield 'NO'
		else:
			yield 'YES'
t = int(input())
ans = gift()
print(*ans, sep='\n')


import queue
import math
t = int(input())
while t:
	n = int(input())
	if n % 4 == 0:
		print('YES')
	else:
		print('NO')
	t -= 1


import sys
from functools import lru_cache, cmp_to_key
from heapq import merge, heapify, heappop, heappush
from math import *
from collections import defaultdict as dd, deque, Counter as C
from itertools import combinations as comb, permutations as perm
from bisect import bisect_left as bl, bisect_right as br, bisect
from time import perf_counter
from fractions import Fraction
sys.setrecursionlimit(int(pow(10, 6)))
mod = int(pow(10, 9) + 7)
mod2 = 998244353

def data():
	return sys.stdin.readline().strip()

def out(*var, end='\n'):
	sys.stdout.write(' '.join(map(str, var)) + end)

def l():
	return list(sp())

def sl():
	return list(ssp())

def sp():
	return map(int, data().split())

def ssp():
	return map(str, data().split())

def l1d(n, val=0):
	return [val for i in range(n)]

def l2d(n, m, val=0):
	return [l1d(n, val) for j in range(m)]
term = l()[0]
for _ in range(term):
	n = l()[0]
	if n % 4 == 0:
		print('YES')
	else:
		print('NO')


num = int(input())
out = []
for nums in range(num):
	ver = int(input())
	if ver % 4 == 0:
		out.append('YES')
	else:
		out.append('NO')
for ans in out:
	print(ans)


for _ in range(int(input())):
	n = int(input())
	ans = 'NO'
	if n % 4 == 0:
		ans = 'YES'
	print(ans)


t = int(input())
c = []
for i in range(t):
	n = int(input())
	if n % 4 == 0:
		c.append('YES')
	else:
		c.append('NO')
for k in c:
	print(k)


for _ in range(int(input())):
	n = int(input())
	v = n % 4
	if v == 0:
		v = n // 4
		v -= 1
		if v >= 0:
			print('YES')
		else:
			print('NO')
	else:
		print('NO')


for _ in range(int(input())):
	n = int(input())
	if n % 4 == 0:
		print('YES')
	else:
		print('No')


t = int(input())
for loop in range(t):
	roger = int(input())
	if roger % 4 == 0:
		print('YES')
	else:
		print('NO')


from collections import Counter, defaultdict, deque
import sys
input = sys.stdin.readline

def primes(n):
	i = 2
	factors = []
	while i * i <= n:
		if n % i:
			i += 1
		else:
			n //= i
			factors.append(i)
	if n > 1:
		factors.append(n)
	return factors

def solve():
	n = int(input())
	print('YES' if n % 4 == 0 else 'NO')
tt = int(input())
for test in range(tt):
	solve()


t = int(input())
lista = []
for i in range(t):
	num = int(input())
	if num % 4 == 0:
		lista.append('YES')
	else:
		lista.append('NO')
for i in lista:
	print(i)


import sys
input = sys.stdin.readline
import heapq
import copy
import math
import decimal

def inp():
	return int(input())

def inlt():
	return list(map(int, input().split()))

def insr():
	s = input()
	return list(s[:len(s) - 1])

def insr2():
	s = input()
	return s[:len(s) - 1]

def invr():
	return map(int, input().split())

def pr_list(a):
	print(*a, sep=' ')

def main():
	tests = inp()
	limit = 10 ** 18
	ans = 0
	for test in range(tests):
		n = inp()
		angle = 360 / n
		if n % 4 == 0 or n * 3 % 4 == 0:
			print('Yes')
		else:
			print('No')
main()


n = int(input())
for i in range(n):
	j = int(input())
	if j & 3 == 0:
		print('YES')
	else:
		print('No')


from sys import stdin
for _ in range(int(stdin.readline())):
	a = int(stdin.readline())
	if a % 4 == 0:
		print('YES')
	else:
		print('NO')


def solve():
	n = int(input())
	if n % 4 == 0:
		print('YES')
	else:
		print('NO')
t = 1
t = int(input())
for _ in range(t):
	solve()


from math import *
t = int(input())
for j in range(t):
	n = int(input())
	x = n / 4 - 1
	if x == int(x):
		print('YES')
	else:
		print('NO')


for _ in range(int(input())):
	n = int(input())
	if n < 4 or n == 0:
		print('NO')
	elif n % 4 == 0:
		print('YES')
	else:
		print('NO')


x = int(input())
for i in range(x):
	y = int(input())
	if y % 4 == 0:
		print('YES')
	else:
		print('NO')


for _ in range(int(input())):
	v = int(input())
	print(('NO', 'YES')[v % 4 == 0])


n = int(input())
for i in range(0, n):
	a = int(input())
	if a == 3:
		print('NO')
	elif a % 4 == 0:
		print('YES')
	else:
		print('NO')


t = int(input())
for _ in range(t):
	n = int(input())
	if n % 4 == 0:
		print('YES')
		continue
	print('NO')


from sys import stdin
from collections import defaultdict as dd
from collections import deque as dq
import itertools as it
from math import sqrt, log, log2
from fractions import Fraction
t = int(input())
for _ in range(t):
	n = int(input())
	print('NO' if n % 4 else 'YES')


def isint(value):
	try:
		int(value)
		return True
	except ValueError:
		return False
t = int(input())
for i in range(t):
	n = int(input())
	if n < 4:
		print('NO')
	elif n % 4 == 0:
		print('YES')
	else:
		print('NO')


n = int(input())
for i in range(n):
	if int(input()) / 2 % 2 == 0:
		print('YES')
	else:
		print('NO')


t = int(input())
for i in range(t):
	n = int(input())
	print('YNEOS'[n % 4 != 0::2])


from sys import stdin, stdout
t = int(stdin.readline())
for _ in range(t):
	n = int(stdin.readline())
	if n % 2 == 0 and n // 2 % 2 == 0:
		print('YES')
	else:
		print('NO')


n = int(input().strip())
res = []
for _ in range(n):
	temp = int(input())
	if temp % 4 == 0:
		res.append('YES')
	else:
		res.append('NO')
for items in res:
	print(items)


def A(n):
	if n % 4 == 0:
		print('YES')
		return
	print('NO')
	return
t = int(input())
for i in range(t):
	n = int(input())
	A(n)


def C1():
	t = int(input())
	ans = []
	for i in range(t):
		n = int(input())
		if n % 4 == 0:
			ans.append('YES')
		else:
			ans.append('NO')
	for j in ans:
		print(j)
C1()


import math
from collections import defaultdict, Counter, deque
INF = float('inf')

def gcd(a, b):
	while b:
		(a, b) = (b, a % b)
	return a

def isPrime(n):
	if n <= 1:
		return False
	i = 2
	while i ** 2 <= n:
		if n % i == 0:
			return False
		i += 1
	return True

def primeFactor(n):
	if n % 2 == 0:
		return 2
	i = 3
	while i ** 2 <= n:
		if n % i == 0:
			return i
		i += 1
	return n

def vars():
	return map(int, input().split())

def array():
	return list(map(int, input().split()))

def main():
	n = int(input())
	for i in range(n):
		s = int(input())
		p = s - 2
		if p % 2 == 0 and p // 2 % 2 == 1:
			print('YES')
		else:
			print('NO')
t = 1
for _ in range(t):
	main()


import math
t = int(input())
for helloworld in range(t):
	n = int(input())
	if n % 4 == 0:
		print('YES')
	else:
		print('NO')


def po(n):
	p = 'YES'
	s = 'NO'
	if n % 4 == 0:
		return p
	else:
		return s
t = int(input())
while t > 0:
	n = int(input())
	l = po(n)
	print(l)
	t = t - 1


for i in range(int(input())):
	print('YNEOS'[int(input()) % 4 != 0::2])


def compute(n):
	if n % 4 == 0:
		return 'YES'
	return 'NO'
t = int(input())
for _ in range(t):
	n = int(input())
	print(compute(n))


def func(n):
	for _ in range(n):
		a = int(input())
		if a % 4 == 0:
			answer.append('YES')
		else:
			answer.append('NO')
	print('\n'.join(answer))
answer = []
func(int(input()))


import math
import sys
sys.setrecursionlimit(10 ** 4)

def Divisors(n):
	l = []
	i = 2
	while i <= math.sqrt(n):
		if n % i == 0:
			if n // i == i:
				l.append(i)
			else:
				l.append(i)
				l.append(n // i)
		i = i + 1
	return l

def SieveOfEratosthenes(n):
	l = []
	prime = [True for i in range(n + 1)]
	p = 2
	while p * p <= n:
		if prime[p] == True:
			for i in range(p * p, n + 1, p):
				prime[i] = False
		p += 1
	for p in range(2, n + 1):
		if prime[p]:
			l.append(p)
	return l

def primeFactors(n):
	l = []
	while n % 2 == 0:
		l.append(2)
		n = n / 2
	for i in range(3, int(math.sqrt(n)) + 1, 2):
		while n % i == 0:
			l.append(i)
			n = n / i
	if n > 2:
		l.append(n)
	return l

def Factors(n):
	result = []
	for i in range(2, int(math.sqrt(n)) + 1):
		if n % i == 0:
			if i == n / i:
				result.append(i)
			else:
				result.append(i)
				result.append(n // i)
	result.append(1)
	result.append(n)
	return result

def maxSubArraySum(a):
	max_so_far = 0
	max_ending_here = 0
	size = len(a)
	for i in range(0, size):
		max_ending_here = max_ending_here + a[i]
		if max_so_far < max_ending_here:
			max_so_far = max_ending_here
		if max_ending_here < 0:
			max_ending_here = 0
	return max_so_far

def longestsubarray(arr, n, k):
	current_count = 0
	max_count = 0
	for i in range(0, n, 1):
		if arr[i] % k != 0:
			current_count += 1
		else:
			current_count = 0
		max_count = max(current_count, max_count)
	return max_count

def main():
	n = int(input())
	if n % 4 == 0:
		print('YES')
	else:
		print('NO')
t = int(input())
for i in range(0, t):
	main()


t = int(input())
D = []
for i in range(0, t):
	n = int(input())
	if n % 4 == 0:
		D.append('YES')
	else:
		D.append('NO')
for i in D:
	print(i)


a = int(input())
for i in range(a):
	b = int(input())
	if not b % 4:
		print('YES')
	else:
		print('NO')


from sys import stdin, stdout
from bisect import bisect, bisect_left, bisect_right

def gt():
	return map(int, stdin.readline().split())

def gi():
	return int(stdin.readline())

def gl():
	return list(map(int, stdin.readline().split()))

def gs():
	return stdin.readline()
t = gi()
for _ in range(t):
	n = gi()
	if not n % 4:
		print('YES')
	else:
		print('NO')


def main():
	for case in range(int(input())):
		n = int(input().strip())
		print('YES' if n % 4 == 0 else 'NO')
main()


def main():
	t = int(input())
	for _ in range(t):
		n = int(input())
		print('YES' if (n - 4) % 4 == 0 else 'NO')
main()


from collections import defaultdict as dd
import sys
input = sys.stdin.readline
t = int(input())
while t:
	n = int(input())
	if n % 4 == 0:
		print('YES')
	else:
		print('NO')
	t -= 1


n = int(input())
ip = []
for i in range(n):
	ip.append(int(input()))
for i in ip:
	if i % 4 == 0:
		print('YES')
	else:
		print('NO')


for lo in range(int(input())):
	n = int(input())
	if n % 4 == 0:
		print('YES')
		continue
	print('NO')


from math import *

def r1(t):
	return t(input())

def r2(t):
	return [t(i) for i in input().split()]
for _ in range(r1(int)):
	n = r1(int)
	if n % 4 == 0:
		print('YES')
	else:
		print('NO')


t = int(input())
cases = []
while t > 0:
	cases.append(int(input()))
	t -= 1
for case in cases:
	if case % 2 == 0 and case / 2 % 2 == 0:
		print('YES')
	else:
		print('NO')


rw = int(input())
for ewqr in range(rw):
	n = int(input())
	if n % 4 == 0:
		print('YES')
	else:
		print('NO')


for i in range(int(input())):
	print('Yes' if int(input()) % 4 == 0 else 'No')


def solve(n):
	if n % 4 == 0:
		return 'YES'
	else:
		return 'NO'
n = int(input())
for i in range(n):
	print(solve(int(input())))


import sys
sys.setrecursionlimit(10000)
t = int(input())
for _ in range(t):
	n = int(input())
	if n % 4 == 0:
		print('YES')
	else:
		print('NO')


import sys
import math

def get_array():
	return list(map(int, sys.stdin.readline().strip().split()))

def get_ints():
	return map(int, sys.stdin.readline().strip().split())

def input():
	return sys.stdin.readline().strip()
for _ in range(int(input())):
	n = int(input())
	if n % 4 == 0:
		print('YES')
	else:
		print('NO')


import sys
input = sys.stdin.readline
N = int(input())
A = [int(input()) for _ in range(N)]
for a in A:
	print('YES' if a % 4 == 0 else 'NO')


t = int(input())
for isc in range(t):
	if int(input()) % 4 == 0:
		print('YES')
	else:
		print('NO')


import sys
data = [line.strip() for line in sys.stdin]
for line in data[1:]:
	if int(line) % 4 == 0:
		print('YES')
	else:
		print('NO')


import os
import sys
from io import BytesIO, IOBase
BUFSIZE = 8192

class FastIO(IOBase):
	newlines = 0

	def __init__(self, file):
		self._fd = file.fileno()
		self.buffer = BytesIO()
		self.writable = 'x' in file.mode or 'r' not in file.mode
		self.write = self.buffer.write if self.writable else None

	def read(self):
		while True:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
			if not b:
				break
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines = 0
		return self.buffer.read()

	def readline(self):
		while self.newlines == 0:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
			self.newlines = b.count(b'\n') + (not b)
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines -= 1
		return self.buffer.readline()

	def flush(self):
		if self.writable:
			os.write(self._fd, self.buffer.getvalue())
			(self.buffer.truncate(0), self.buffer.seek(0))

class IOWrapper(IOBase):

	def __init__(self, file):
		self.buffer = FastIO(file)
		self.flush = self.buffer.flush
		self.writable = self.buffer.writable
		self.write = lambda s: self.buffer.write(s.encode('ascii'))
		self.read = lambda : self.buffer.read().decode('ascii')
		self.readline = lambda : self.buffer.readline().decode('ascii')
(sys.stdin, sys.stdout) = (IOWrapper(sys.stdin), IOWrapper(sys.stdout))
input = lambda : sys.stdin.readline().rstrip('\r\n')
from math import gcd, ceil

def pre(s):
	n = len(s)
	pi = [0] * n
	for i in range(1, n):
		j = pi[i - 1]
		while j and s[i] != s[j]:
			j = pi[j - 1]
		if s[i] == s[j]:
			j += 1
		pi[i] = j
	return pi

def prod(a):
	ans = 1
	for each in a:
		ans = ans * each
	return ans

def lcm(a, b):
	return a * b // gcd(a, b)

def binary(x, length=16):
	y = bin(x)[2:]
	return y if len(y) >= length else '0' * (length - len(y)) + y
for _ in range(int(input()) if True else 1):
	n = int(input())
	print('YES' if n % 4 == 0 else 'NO')


from math import *
t = int(input())
while t != 0:
	a = int(input())
	if a % 4 == 0:
		print('YES')
	else:
		print('NO')
	t = t - 1


inp = lambda : int(input())
inpm = lambda : map(int, input().split())
inpl = lambda : list(inpm())
l2mn = lambda _n, _m: [[0 for __ in range(_m)] for _ in range(_n)]
l2n = lambda _n: l2mn(_n, _n)
INF = int(1e+18)
MOD = int(1000000000.0) + 7

def solve():
	n = inp()
	if n % 4 == 0:
		print('YES')
	else:
		print('NO')

def main():
	t = inp()
	for i in range(t):
		solve()
main()


def x(a):
	a = int(a)
	if a % 4 == 0:
		return 'YES'
	else:
		return 'NO'
t = int(input())
for _ in range(t):
	print(x(input()))


t = int(input())
for _ in range(t):
	n = int(input())
	print(['YES', 'NO', 'NO', 'NO'][n % 4])


t = int(input())
while t:
	n = int(input())
	if n <= 3:
		print('NO')
	elif n % 4 == 0:
		print('YES')
	else:
		print('NO')
	t = t - 1


import sys
ip = lambda : sys.stdin.readline().rstrip()
from math import gcd
for _ in range(int(ip())):
	n = int(ip())
	if n % 4 == 0:
		print('yes')
	else:
		print('no')


t = int(input())
while t:
	t -= 1
	n = int(input())
	if n % 4 == 0:
		print('yes')
	else:
		print('no')


from sys import stdin, stdout

class SOLVE:

	def solve(self):
		r = stdin.readline
		w = stdout.write
		ans = []
		for i in range(int(input())):
			n = int(r())
			if n % 4:
				ans += ['NO', '\n']
			else:
				ans += ['YES', '\n']
		w(''.join(ans))

def main():
	s = SOLVE()
	s.solve()
main()


tc = int(input())
for i in range(tc):
	n = int(input())
	if n % 4 == 0 and n > 0:
		print('YES')
	else:
		print('NO')


def ans(n):
	k = 0
	while n % 2 == 0:
		k += 1
		n //= 2
	return k
t = int(input())
while t:
	t -= 1
	n = int(input())
	k = ans(n)
	if k < 2:
		print('NO')
	else:
		print('YES')


import sys, math
t = int(input())
for i in range(t):
	ni = int(input())
	if ni % 4 == 0:
		print('YES')
	else:
		print('NO')


def solve(n):
	res = 90 * n
	if res % 360 == 0:
		return 'YES'
	else:
		return 'NO'
	return res
t = int(input())
for _ in range(t):
	n = int(input())
	res = solve(n)
	print(res)


for i in range(int(input())):
	print('YNEOS'[int(input()) & 3 > 0::2])


import os
import sys
from io import BytesIO, IOBase
profile = 0
pypy = 1

def iin():
	return int(input())

def lin():
	return list(map(int, input().split()))

def main():
	T = iin()
	while T:
		T -= 1
		n = iin()
		print('YES' if n % 4 == 0 else 'NO')
BUFSIZE = 8192

class FastIO(IOBase):
	newlines = 0

	def __init__(self, file):
		self._fd = file.fileno()
		self.buffer = BytesIO()
		self.writable = 'x' in file.mode or 'r' not in file.mode
		self.write = self.buffer.write if self.writable else None

	def read(self):
		while True:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
			if not b:
				break
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines = 0
		return self.buffer.read()

	def readline(self):
		while self.newlines == 0:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
			self.newlines = b.count(b'\n') + (not b)
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines -= 1
		return self.buffer.readline()

	def flush(self):
		if self.writable:
			os.write(self._fd, self.buffer.getvalue())
			(self.buffer.truncate(0), self.buffer.seek(0))

class IOWrapper(IOBase):

	def __init__(self, file):
		self.buffer = FastIO(file)
		self.flush = self.buffer.flush
		self.writable = self.buffer.writable
		self.write = lambda s: self.buffer.write(s.encode('ascii'))
		self.read = lambda : self.buffer.read().decode('ascii')
		self.readline = lambda : self.buffer.readline().decode('ascii')
if pypy:
	(sys.stdin, sys.stdout) = (IOWrapper(sys.stdin), IOWrapper(sys.stdout))
	input = lambda : sys.stdin.readline().rstrip('\r\n')
if profile:
	import cProfile
	cProfile.run('main()')
else:
	main()


def nod(a, b):
	while a != b:
		(a, b) = (max(a, b), min(a, b))
		if a % b == 0:
			a -= (a // b - 1) * b
		else:
			a -= a // b * b
	return a
for t in range(int(input())):
	print('YES' if int(input()) % 4 == 0 else 'NO')


def solve():
	n = int(input())
	if n % 4 == 0:
		print('Yes')
		return
	print('No')
	return

def main():
	t = int(input())
	while t > 0:
		solve()
		t -= 1
main()


tc = int(input())
for i in range(tc):
	N = int(input())
	if N % 4 == 0:
		print('yEs')
	else:
		print('nO')
	if N == 69420:
		print('bing bong')


from math import ceil, log, floor, sqrt
import math

def mod_expo(n, p, m):
	result = 1
	while p != 0:
		if p % 2 == 1:
			result = result * n % m
		p //= 2
		n = n * n % m
	return result

def is_beauty(n):
	if n % 4 == 0:
		return 'YES'
	else:
		return 'NO'
t = 1
t = int(input())
while t:
	t = t - 1
	n = int(input())
	print(is_beauty(n))


import sys
import heapq
import random
import collections

def solve(k):
	console('----- solving ------')
	if k % 4 == 0:
		return 'YES'
	else:
		return 'NO'

def console(*args):
	print('\x1b[36m', *args, '\x1b[0m', file=sys.stderr)
	return
for case_num in range(int(input())):
	k = int(input())
	res = solve(k)
	print(res)


from sys import stdin, stdout
import sys
from math import *
for __ in range(int(input())):
	n = int(input())
	if n % 4 == 0:
		print('YES')
	else:
		print('NO')


t = int(input())
while t > 0:
	n = int(input())
	if n % 4 == 0:
		print('Yes')
	else:
		print('No')
	t -= 1


for _ in range(int(input())):
	nside = int(input())
	if nside >= 3:
		if nside % 4 == 0:
			print('YES')
		else:
			print('NO')
	else:
		print('NO')


t = int(input())
for q in range(t):
	n = int(input())
	c = 360
	z = n
	if 90 * z / c == round(90 * z / c):
		print('YES')
	else:
		print('NO')


import sys
import math
from sys import stdin, stdout
from collections import deque, defaultdict
from math import ceil, floor, inf, sqrt, factorial, gcd, log2
from copy import deepcopy
ii1 = lambda : int(stdin.readline().strip())
is1 = lambda : stdin.readline().strip()
iia = lambda : list(map(int, stdin.readline().strip().split()))
isa = lambda : stdin.readline().strip().split()
mod = 1000000007
for i in range(ii1()):
	n = ii1()
	if n % 4 == 0:
		print('YES')
	else:
		print('NO')


(T,) = map(int, input().split())
for _ in range(T):
	(N,) = map(int, input().split())
	if N % 4:
		print('NO')
	else:
		print('YES')


for _ in range(int(input())):
	n = int(input())
	if n % 4:
		print('No')
	else:
		print('Yes')


import sys
import math
import collections
from sys import stdin, stdout, setrecursionlimit
import bisect as bs
setrecursionlimit(2 ** 20)
M = 10 ** 9 + 7
T = int(stdin.readline())
for _ in range(T):
	n = int(stdin.readline())
	if n % 4 == 0:
		print('YES')
	else:
		print('NO')


import sys
cont = sys.stdin.readlines()
cont = [i.strip('\n') for i in cont]
numTests = int(cont.pop(0)[0])
cont = [int(i) for i in cont]
for i in cont:
	if i % 4 == 0:
		print('YES')
	else:
		print('NO')


for s in [*open(0)][1:]:
	print('YNEOS'[int(s) % 4 > 0::2])


t = input()
t = int(t)
test = 0
while True:
	test += 1
	if test > t:
		break
	a = input()
	a = int(a)
	if a % 4 == 0:
		print('YES')
	else:
		print('NO')


for t in range(int(input())):
	n = int(input())
	a = (n - 2) * 180
	if a == 90 * n or 90 * n % 360 == 0:
		print('YES')
	else:
		print('NO')


t = int(input())
for _ in range(t):
	n = int(input())
	if n % 2 == 1:
		print('NO')
	else:
		print('YES' if (n - 2) // 2 % 2 == 1 else 'NO')


import sys
input = sys.stdin.readline

def getInt():
	return int(input())

def getVars():
	return map(int, input().split())

def getList():
	return list(map(int, input().split()))

def getStr():
	return input().strip()
q = getInt()
for _ in range(q):
	n = getInt()
	if n % 4 == 0:
		print('YES')
	else:
		print('NO')


I = lambda : list(map(int, input().split()))
for tc in range(int(input())):
	(n,) = I()
	print('YES' if n % 2 == 0 and n % 4 == 0 else 'NO')


from sys import stdin, stdout
import math, sys
from itertools import permutations, combinations
from collections import defaultdict, deque, OrderedDict
from os import path
import bisect as bi
import heapq

def yes():
	print('YES')

def no():
	print('NO')
if path.exists('input.txt'):
	sys.stdin = open('input.txt', 'r')
	sys.stdout = open('output.txt', 'w')

	def I():
		return int(input())

	def In():
		return map(int, input().split())
else:

	def I():
		return int(stdin.readline())

	def In():
		return map(int, stdin.readline().split())

def main():
	try:
		n = I()
		if n % 4 == 0:
			yes()
		else:
			no()
	except:
		pass
M = 998244353
P = 1000000007
for _ in range(I()):
	main()


n = int(input())
for i in range(n):
	a = int(input())
	res = (90 * a + 360) / 360
	if int(res) == res:
		print('YES')
	else:
		print('NO')


def inp():
	return int(input())

def inlt():
	return list(map(int, input().split()))

def insr():
	s = input()
	return list(s[:len(s)])

def invr():
	return map(int, input().split())
entries = inp()
for i in range(entries):
	n = inp()
	if n % 4 == 0:
		print('YES')
	else:
		print('NO')


from collections import defaultdict
import sys, math
f = None
try:
	f = open('q1.input', 'r')
except IOError:
	f = sys.stdin
if 'xrange' in dir(__builtins__):
	range = xrange
sys.setrecursionlimit(10 ** 2)

def print_case_iterable(case_num, iterable):
	print('Case #{}: {}'.format(case_num, ' '.join(map(str, iterable))))

def print_case_number(case_num, iterable):
	print('Case #{}: {}'.format(case_num, iterable))

def print_iterable(A):
	print(' '.join(A))

def read_int():
	return int(f.readline().strip())

def read_int_array():
	return [int(x) for x in f.readline().strip().split(' ')]

def rns():
	a = [x for x in f.readline().split(' ')]
	return (int(a[0]), a[1].strip())

def read_string():
	return list(f.readline().strip())

def ri():
	return int(f.readline().strip())

def ria():
	return [int(x) for x in f.readline().strip().split(' ')]

def rns():
	a = [x for x in f.readline().split(' ')]
	return (int(a[0]), a[1].strip())

def rs():
	return list(f.readline().strip())

def bi(x):
	return bin(x)[2:]
from collections import deque
import math
NUMBER = 10 ** 9 + 7

def factorial(n):
	M = NUMBER
	f = 1
	for i in range(1, n + 1):
		f = f * i % M
	return f

def mult(a, b):
	return a * b % NUMBER

def minus(a, b):
	return (a - b) % NUMBER

def plus(a, b):
	return (a + b) % NUMBER

def egcd(a, b):
	if a == 0:
		return (b, 0, 1)
	else:
		(g, y, x) = egcd(b % a, a)
		return (g, x - b // a * y, y)

def modinv(a):
	m = NUMBER
	(g, x, y) = egcd(a, m)
	if g != 1:
		raise Exception('modular inverse does not exist')
	else:
		return x % m

def choose(n, k):
	if n < k:
		assert false
	return mult(factorial(n), modinv(mult(factorial(k), factorial(n - k)))) % NUMBER
from collections import deque, defaultdict
import heapq
from types import GeneratorType

def bootstrap(f, stack=[]):

	def wrappedfunc(*args, **kwargs):
		if stack:
			return f(*args, **kwargs)
		else:
			to = f(*args, **kwargs)
			while True:
				if type(to) is GeneratorType:
					stack.append(to)
					to = next(to)
				else:
					stack.pop()
					if not stack:
						break
					to = stack[-1].send(to)
			return to
	return wrappedfunc

def dfs(g, timeIn, timeOut, depths, parents):
	cnt = 0
	stack = [[1, 0, 0, 0]]
	while stack:
		(v, neig_i, parent, depth) = stack[-1]
		parents[v] = parent
		depths[v] = depth
		if neig_i == 0:
			timeIn[v] = cnt
			cnt += 1
		while neig_i < len(g[v]):
			u = g[v][neig_i]
			if u == parent:
				neig_i += 1
				continue
			stack[-1][1] = neig_i + 1
			stack.append([u, 0, v, depth + 1])
			break
		if neig_i == len(g[v]):
			stack.pop()
			timeOut[v] = cnt
			cnt += 1
cnt = 0

@bootstrap
def dfs(v, adj, timeIn, timeOut, depths, parents, parent=0, depth=0):
	global cnt
	parents[v] = parent
	depths[v] = depth
	timeIn[v] = cnt
	cnt += 1
	for u in adj[v]:
		if u == parent:
			continue
		yield dfs(u, adj, timeIn, timeOut, depths, parents, v, depth + 1)
	timeOut[v] = cnt
	cnt += 1
	yield

def gcd(a, b):
	if a == 0:
		return b
	return gcd(b % a, a)

def lcm(a, b):
	return a * b / gcd(a, b)

def solution(n):
	return 'YES' if n % 4 == 0 else 'NO'

def main():
	T = ri()
	for i in range(T):
		n = ri()
		x = solution(n)
		if 'xrange' not in dir(__builtins__):
			print(x)
		else:
			(print >> output, str(x))
	if 'xrange' in dir(__builtins__):
		print(output.getvalue())
		output.close()
if 'xrange' in dir(__builtins__):
	import cStringIO
	output = cStringIO.StringIO()
main()


n = int(input())
a = [int(input())]
for i in range(1, n):
	a.append(int(input()))
for i in a:
	if i % 4 == 0:
		print('YES')
	else:
		print('NO')


t = int(input())
for _ in range(t):
	n = int(input())
	perpendicular = n * 0.75
	print('YES' if perpendicular.is_integer() else 'NO')


t = int(input())
arr = [0] * t
for i in range(t):
	arr[i] = int(input())
for i in range(t):
	if arr[i] > 2:
		if arr[i] % 2 == 0:
			if (arr[i] / 2 - 2) % 2 == 0:
				print('YES')
			else:
				print('NO')
		else:
			print('NO')


for k in range(int(input())):
	a = int(input())
	t = (a - 2) * 180
	if a % 4 == 0:
		print('YES')
	else:
		print('NO')


T = int(input())
for i in range(T):
	N = int(input())
	if N % 4 == 0:
		print('YES')
	else:
		print('NO')


polygons_market = int(input())
for e in range(polygons_market):
	n = int(input())
	if n % 4 == 0:
		print('yes')
	else:
		print('no')


n = int(input())
lst = []
for _ in range(n):
	num = int(input())
	if num > 0 and num % 4 == 0:
		lst.append('YES')
	else:
		lst.append('NO')
print('\n'.join(lst))


def ques1(n):
	if n % 4 == 0:
		print('YES')
	else:
		print('NO')
t = int(input())
for i in range(t):
	n = int(input())
	ans = ques1(n)
	ans


for _ in ' ' * int(input()):
	print('YNEOS'[int(input()) % 4 != 0::2])


import sys
RI = lambda : [int(x) for x in sys.stdin.readline().strip().split()]
from collections import defaultdict as df
from math import *
t = int(input().strip())
for _ in range(t):
	n = int(input().strip())
	if n % 4 == 0:
		print('YES')
	else:
		print('NO')


import os
import sys
from io import BytesIO, IOBase
BUFSIZE = 8192

class FastIO(IOBase):
	newlines = 0

	def __init__(self, file):
		self._fd = file.fileno()
		self.buffer = BytesIO()
		self.writable = 'x' in file.mode or 'r' not in file.mode
		self.write = self.buffer.write if self.writable else None

	def read(self):
		while True:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
			if not b:
				break
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines = 0
		return self.buffer.read()

	def readline(self):
		while self.newlines == 0:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
			self.newlines = b.count(b'\n') + (not b)
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines -= 1
		return self.buffer.readline()

	def flush(self):
		if self.writable:
			os.write(self._fd, self.buffer.getvalue())
			(self.buffer.truncate(0), self.buffer.seek(0))

class IOWrapper(IOBase):

	def __init__(self, file):
		self.buffer = FastIO(file)
		self.flush = self.buffer.flush
		self.writable = self.buffer.writable
		self.write = lambda s: self.buffer.write(s.encode('ascii'))
		self.read = lambda : self.buffer.read().decode('ascii')
		self.readline = lambda : self.buffer.readline().decode('ascii')
(sys.stdin, sys.stdout) = (IOWrapper(sys.stdin), IOWrapper(sys.stdout))
input = lambda : sys.stdin.readline().rstrip('\r\n')

def list2d(a, b, c):
	return [[c] * b for i in range(a)]

def list3d(a, b, c, d):
	return [[[d] * c for j in range(b)] for i in range(a)]

def list4d(a, b, c, d, e):
	return [[[[e] * d for j in range(c)] for j in range(b)] for i in range(a)]

def ceil(x, y=1):
	return int(-(-x // y))

def Yes():
	print('Yes')

def No():
	print('No')

def YES():
	print('YES')

def NO():
	print('NO')
INF = 10 ** 18
MOD = 10 ** 9 + 7
Ri = lambda : [int(x) for x in sys.stdin.readline().split()]
ri = lambda : sys.stdin.readline().strip()
for _ in range(int(ri())):
	n = int(ri())
	if n % 4 == 0:
		YES()
	else:
		NO()


def inp():
	return int(input())

def insr():
	s = input()
	return s

def inlt():
	return list(map(int, input().split()))
r = inp()
for i in range(r):
	l2 = inp()
	if l2 % 4 == 0:
		print('YES')
	else:
		print('NO')


t = int(input())
a = []
for i in range(t):
	a.append(int(input()))
for j in range(t):
	if a[j] % 4 == 0:
		print('YES')
	else:
		print('NO')


for i in [*open(0)][1:]:
	print('YNEOS'[int(i) % 4 != 0::2])


t = int(input())
for i in range(t):
	n = int(input())
	inte = 180 - 360 / n
	if n % 4 == 0:
		print('YES')
	else:
		print('NO')


exec(int(input()) * "print('YNEOS'[int(input())%4>0::2]);")


n = int(input())
for i in range(n):
	num = int(input())
	ans = 'YES' if num % 4 == 0 else 'NO'
	print(ans)


from functools import reduce
import collections
import math
import sys

class Read:

	@staticmethod
	def string():
		return input()

	@staticmethod
	def int():
		return int(input())

	@staticmethod
	def list(delimiter=' '):
		return input().split(delimiter)

	@staticmethod
	def list_int(delimiter=' '):
		return list(map(int, input().split(delimiter)))

def main():
	t = Read.int()
	for _ in range(t):
		n = Read.int()
		if (n - 4) % 4 == 0:
			print('YES')
		else:
			print('NO')
main()


try:
	t = int(input())
	for i in range(t):
		n = int(input())
		if n % 4 == 0:
			print('YES')
		else:
			print('NO')
except:
	pass


from __future__ import division, print_function
from fractions import Fraction
import sys
import os
from io import BytesIO, IOBase
import bisect
from heapq import *
from math import *
from collections import deque
from collections import Counter as counter
from itertools import combinations as comb
from itertools import permutations as permutate
from bisect import bisect_left as bl
from bisect import bisect_right as br
from bisect import bisect
BUFSIZE = 8192

class FastIO(IOBase):
	newlines = 0

	def __init__(self, file):
		self._fd = file.fileno()
		self.buffer = BytesIO()
		self.writable = 'x' in file.mode or 'r' not in file.mode
		self.write = self.buffer.write if self.writable else None

	def read(self):
		while True:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
			if not b:
				break
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines = 0
		return self.buffer.read()

	def readline(self):
		while self.newlines == 0:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
			self.newlines = b.count(b'\n') + (not b)
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines -= 1
		return self.buffer.readline()

	def flush(self):
		if self.writable:
			os.write(self._fd, self.buffer.getvalue())
			(self.buffer.truncate(0), self.buffer.seek(0))

class IOWrapper(IOBase):

	def __init__(self, file):
		self.buffer = FastIO(file)
		self.flush = self.buffer.flush
		self.writable = self.buffer.writable
		self.write = lambda s: self.buffer.write(s.encode('ascii'))
		self.read = lambda : self.buffer.read().decode('ascii')
		self.readline = lambda : self.buffer.readline().decode('ascii')

def print(*args, **kwargs):
	(sep, file) = (kwargs.pop('sep', ' '), kwargs.pop('file', sys.stdout))
	at_start = True
	for x in args:
		if not at_start:
			file.write(sep)
		file.write(str(x))
		at_start = False
	file.write(kwargs.pop('end', '\n'))
	if kwargs.pop('flush', False):
		file.flush()
if sys.version_info[0] < 3:
	(sys.stdin, sys.stdout) = (FastIO(sys.stdin), FastIO(sys.stdout))
else:
	(sys.stdin, sys.stdout) = (IOWrapper(sys.stdin), IOWrapper(sys.stdout))
mod = 1000000007

def inp():
	return sys.stdin.readline().rstrip('\r\n')

def out(var):
	sys.stdout.write(str(var))

def lis():
	return list(map(int, inp().split()))

def stringlis():
	return list(map(str, inp().split()))

def sep():
	return map(int, inp().split())

def strsep():
	return map(str, inp().split())

def graph(vertex):
	return [[] for i in range(0, vertex + 1)]

def zerolist(n):
	return [0] * n

def nextline():
	out('\n')

def testcase(t):
	for p in range(t):
		solve()

def printlist(a):
	for p in range(0, len(a)):
		out(str(a[p]) + ' ')

def lcm(a, b):
	return a * b // gcd(a, b)

def power(a, b):
	ans = 1
	while b > 0:
		if b % 2 == 1:
			ans *= a
		a *= a
		b //= 2
	return ans

def ncr(n, r):
	return factorial(n) // (factorial(r) * factorial(max(n - r, 1)))

def isPrime(n):
	if n <= 1:
		return False
	if n <= 3:
		return True
	if n % 2 == 0 or n % 3 == 0:
		return False
	i = 5
	while i * i <= n:
		if n % i == 0 or n % (i + 2) == 0:
			return False
		i = i + 6
	return True

def bs(a, l, h, x):
	while l < h:
		mid = (l + h) // 2
		if a[mid] == x:
			return mid
		if a[mid] < x:
			l = mid + 1
		else:
			h = mid
	return l

def sieve(a):
	for i in range(3, 10 ** 6 + 1, 2):
		a[i] = 1
	for i in range(3, 10 ** 6 + 1, 2):
		for j in range(i * i, 10 ** 6 + 1, i):
			a[j] = 0
	a[2] = 1
	return a

def solve():
	n = int(inp())
	if n % 4 == 0:
		print('YES')
	else:
		print('NO')
testcase(int(inp()))


tc = int(input())
for _ in range(tc):
	x = int(input())
	if x % 4 == 0:
		print('YES')
	else:
		print('NO')


t = int(input())
while t > 0:
	t -= 1
	c = int(input())
	if c == 3:
		print('NO')
	else:
		c -= 4
		if c % 4 == 0:
			print('YES')
		else:
			print('NO')


import os, sys
from io import IOBase, BytesIO
from functools import lru_cache, cmp_to_key
from heapq import merge, heapify, heappop, heappush
from math import ceil, floor, gcd, fabs, factorial, fmod, sqrt, inf, log, pi, sin
from collections import defaultdict as dd, deque, Counter as C
from itertools import combinations as comb, permutations as perm
from bisect import bisect_left as bl, bisect_right as br, bisect
from time import perf_counter
from fractions import Fraction
mod = pow(10, 9) + 7
mod2 = 998244353

def data():
	return sys.stdin.readline().strip()

def out(var, end='\n'):
	sys.stdout.write(str(var) + end)

def outarr(*var, end='\n'):
	sys.stdout.write(' '.join(map(str, var)) + end)

def l():
	return list(sp())

def sl():
	return list(ssp())

def sp():
	return map(int, data().split())

def ssp():
	return map(str, data().split())

def l1d(n, val):
	return [val for i in range(n)]

def l2d(n, m, val):
	return [l1d(m, val) for j in range(n)]
for _ in range(int(data())):
	n = int(data())
	if n % 4 == 0:
		out('YES')
		continue
	out('NO')


from __future__ import division, print_function
import os
import sys
from io import BytesIO, IOBase
if sys.version_info[0] < 3:
	from __builtin__ import xrange as range
	from future_builtins import ascii, filter, hex, map, oct, zip

def solve(t):
	n = int(input())
	return 'YES' if n % 4 == 0 else 'NO'

def main():
	tc = int(input().strip())
	for t in range(1, tc + 1):
		print(solve(t))
BUFSIZE = 8192

class FastIO(IOBase):
	newlines = 0

	def __init__(self, file):
		self._fd = file.fileno()
		self.buffer = BytesIO()
		self.writable = 'x' in file.mode or 'r' not in file.mode
		self.write = self.buffer.write if self.writable else None

	def read(self):
		while True:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
			if not b:
				break
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines = 0
		return self.buffer.read()

	def readline(self):
		while self.newlines == 0:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
			self.newlines = b.count(b'\n') + (not b)
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines -= 1
		return self.buffer.readline()

	def flush(self):
		if self.writable:
			os.write(self._fd, self.buffer.getvalue())
			(self.buffer.truncate(0), self.buffer.seek(0))

class IOWrapper(IOBase):

	def __init__(self, file):
		self.buffer = FastIO(file)
		self.flush = self.buffer.flush
		self.writable = self.buffer.writable
		self.write = lambda s: self.buffer.write(s.encode('ascii'))
		self.read = lambda : self.buffer.read().decode('ascii')
		self.readline = lambda : self.buffer.readline().decode('ascii')

def print(*args, **kwargs):
	(sep, file) = (kwargs.pop('sep', ' '), kwargs.pop('file', sys.stdout))
	at_start = True
	for x in args:
		if not at_start:
			file.write(sep)
		file.write(str(x))
		at_start = False
	file.write(kwargs.pop('end', '\n'))
	if kwargs.pop('flush', False):
		file.flush()
if sys.version_info[0] < 3:
	(sys.stdin, sys.stdout) = (FastIO(sys.stdin), FastIO(sys.stdout))
else:
	(sys.stdin, sys.stdout) = (IOWrapper(sys.stdin), IOWrapper(sys.stdout))
input = lambda : sys.stdin.readline().rstrip('\r\n')
main()


import sys, bisect, string, math, time, functools, random, fractions
from heapq import heappush, heappop, heapify
from collections import deque, defaultdict, Counter
from itertools import permutations, combinations, groupby
rep = range

def Golf():
	(n, *t) = map(int, open(0).read().split())

def I():
	return int(input())

def S_():
	return input()

def IS():
	return input().split()

def LS():
	return [i for i in input().split()]

def MI():
	return map(int, input().split())

def LI():
	return [int(i) for i in input().split()]

def LI_():
	return [int(i) - 1 for i in input().split()]

def NI(n):
	return [int(input()) for i in range(n)]

def NI_(n):
	return [int(input()) - 1 for i in range(n)]

def StoLI():
	return [ord(i) - 97 for i in input()]

def ItoS(n):
	return chr(n + 97)

def LtoS(ls):
	return ''.join([chr(i + 97) for i in ls])

def RA():
	return map(int, open(0).read().split())

def GI(V, E, ls=None, Directed=False, index=1):
	org_inp = []
	g = [[] for i in range(V)]
	FromStdin = True if ls == None else False
	for i in range(E):
		if FromStdin:
			inp = LI()
			org_inp.append(inp)
		else:
			inp = ls[i]
		if len(inp) == 2:
			(a, b) = inp
			c = 1
		else:
			(a, b, c) = inp
		if index == 1:
			a -= 1
			b -= 1
		aa = (a, c)
		bb = (b, c)
		g[a].append(bb)
		if not Directed:
			g[b].append(aa)
	return (g, org_inp)

def GGI(h, w, search=None, replacement_of_found='.', mp_def={'#': 1, '.': 0}, boundary=1):
	mp = [boundary] * (w + 2)
	found = {}
	for i in range(h):
		s = input()
		for char in search:
			if char in s:
				found[char] = (i + 1) * (w + 2) + s.index(char) + 1
				mp_def[char] = mp_def[replacement_of_found]
		mp += [boundary] + [mp_def[j] for j in s] + [boundary]
	mp += [boundary] * (w + 2)
	return (h + 2, w + 2, mp, found)

def TI(n):
	return GI(n, n - 1)

def accum(ls):
	rt = [0]
	for i in ls:
		rt += [rt[-1] + i]
	return rt

def bit_combination(n, base=2):
	rt = []
	for tb in range(base ** n):
		s = [tb // base ** bt % base for bt in range(n)]
		rt += [s]
	return rt

def gcd(x, y):
	if y == 0:
		return x
	if x % y == 0:
		return y
	while x % y != 0:
		(x, y) = (y, x % y)
	return y

def YN(x):
	print(['NO', 'YES'][x])

def Yn(x):
	print(['No', 'Yes'][x])

def show(*inp, end='\n'):
	if show_flg:
		print(*inp, end=end)
mo = 10 ** 9 + 7
inf = float('inf')
FourNb = [(-1, 0), (1, 0), (0, 1), (0, -1)]
EightNb = [(-1, 0), (1, 0), (0, 1), (0, -1), (1, 1), (-1, -1), (1, -1), (-1, 1)]
compas = dict(zip('WENS', FourNb))
cursol = dict(zip('LRUD', FourNb))
l_alp = string.ascii_lowercase
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
input = lambda : sys.stdin.readline().rstrip()

class Tree:

	def __init__(self, inp_size=None, ls=None, init=True, index=1):
		self.LCA_init_stat = False
		self.ETtable = []
		if init:
			if ls == None:
				self.stdin(inp_size, index=index)
			else:
				self.node_size = len(ls) + 1
				(self.edges, _) = GI(self.node_size, self.node_size - 1, ls, index=index)
		return

	def stdin(self, inp_size=None, index=1):
		if inp_size == None:
			self.node_size = int(input())
		else:
			self.node_size = inp_size
		(self.edges, _) = GI(self.node_size, self.node_size - 1, index=index)
		return

	def listin(self, ls, index=0):
		self.node_size = len(ls) + 1
		(self.edges, _) = GI(self.node_size, self.node_size - 1, ls, index=index)
		return

	def dfs(self, x, func=lambda pr, prv, nx, dist: prv + dist, root_v=0):
		q = deque([x])
		v = [None] * self.node_size
		v[x] = root_v
		while q:
			c = q.pop()
			for (nb, d) in self.edges[c]:
				if v[nb] == None:
					q.append(nb)
					v[nb] = func(c, v[c], nb, d)
		return v

	def bfs(self, x, func=lambda pr, prv, nx, dist: prv + dist, root_v=0):
		q = deque([x])
		v = [None] * self.node_size
		v[x] = root_v
		while q:
			c = q.popleft()
			for (nb, d) in self.edges[c]:
				if v[nb] == None:
					q.append(nb)
					v[nb] = func(c, v[c], nb, d)
		return v

	def parent(self, x):
		return self.dfs(0, func=lambda pr, prv, nx, dist: pr, root_v=-1)

	def topological_sort(self, x):
		tps = []
		q = deque([x])
		v = [None] * self.node_size
		v[x] = 0
		while q:
			c = q.popleft()
			tps.append(c)
			for (nb, d) in self.edges[c]:
				if v[nb] == None:
					q.append(nb)
					v[nb] = 0
		return tps

	def EulerTour(self, x):
		q = deque()
		q.append(x)
		self.depth = [None] * self.node_size
		self.depth[x] = 0
		self.ETtable = []
		self.ETdepth = []
		self.ETin = [-1] * self.node_size
		self.ETout = [-1] * self.node_size
		cnt = 0
		while q:
			c = q.pop()
			if c < 0:
				ce = ~c
			else:
				ce = c
				for (nb, d) in self.edges[ce]:
					if self.depth[nb] == None:
						q.append(~ce)
						q.append(nb)
						self.depth[nb] = self.depth[ce] + 1
			self.ETtable.append(ce)
			self.ETdepth.append(self.depth[ce])
			if self.ETin[ce] == -1:
				self.ETin[ce] = cnt
			else:
				self.ETout[ce] = cnt
			cnt += 1
		return

	def LCA_init(self, root):
		self.EulerTour(root)
		self.st = SparseTable(self.ETdepth, init_func=min, init_idl=inf)
		self.LCA_init_stat = True
		return

	def LCA(self, root, x, y):
		if self.LCA_init_stat == False:
			self.LCA_init(root)
		(xin, xout) = (self.ETin[x], self.ETout[x])
		(yin, yout) = (self.ETin[y], self.ETout[y])
		a = min(xin, yin)
		b = max(xout, yout, xin, yin)
		id_of_min_dep_in_et = self.st.query_id(a, b + 1)
		return self.ETtable[id_of_min_dep_in_et]

	def __str__(self):
		return str(self.edges)

	def show(self):
		if all([all([d == 1 for (nd, d) in e]) for e in self.edges]):
			print([[nd for (nd, d) in e] for e in self.edges])
		else:
			print(self)

class SparseTable:

	def __init__(self, ls, init_func=min, init_idl=float('inf')):
		self.func = init_func
		self.idl = init_idl
		self.size = len(ls)
		self.N0 = self.size.bit_length()
		self.table = [ls[:]]
		self.index = [list(range(self.size))]
		self.lg = [0] * (self.size + 1)
		for i in range(2, self.size + 1):
			self.lg[i] = self.lg[i >> 1] + 1
		for i in range(self.N0):
			tmp = [self.func(self.table[i][j], self.table[i][min(j + (1 << i), self.size - 1)]) for j in range(self.size)]
			tmp_id = [self.index[i][j] if self.table[i][j] == self.func(self.table[i][j], self.table[i][min(j + (1 << i), self.size - 1)]) else self.index[i][min(j + (1 << i), self.size - 1)] for j in range(self.size)]
			self.table += [tmp]
			self.index += [tmp_id]

	def query(self, l, r):
		if r > self.size:
			r = self.size
		N = self.lg[r - l]
		return self.func(self.table[N][l], self.table[N][max(0, r - (1 << N))])

	def query_id(self, l, r):
		if r > self.size:
			r = self.size
		N = self.lg[r - l]
		(a, b) = (self.index[N][l], self.index[N][max(0, r - (1 << N))])
		if self.table[0][a] == self.func(self.table[N][l], self.table[N][max(0, r - (1 << N))]):
			b = a
		return b

	def right_bound(self, pos, x):
		k = (self.size - pos).bit_length()
		for j in range(k)[::-1]:
			nx = pos + (1 << j)
			if nx < n and self.query(pos, nx + 1) <= x:
				pos += 1 << j
		return pos

	def left_bound(self, pos, x):
		k = pos.bit_length()
		for j in range(k)[::-1]:
			nx = pos - (1 << j)
			if 0 <= nx and self.query(nx, pos + 1) <= x:
				pos -= 1 << j
		return pos

	def __str__(self):
		return str(self.table[0])

	def print(self):
		for i in self.table:
			print(*i)
show_flg = False
show_flg = True
ans = 0
for _ in range(int(input())):
	ans = 0
	n = I()
	YN(n % 4 == 0)


for _ in range(int(input())):
	m = int(input())
	if m % 4 != 0:
		print('No')
	else:
		print('Yes')


from collections import defaultdict, Counter
import math
from functools import reduce, lru_cache
from heapq import heapify, heappush, heappop
import sys
from sys import stdin, stdout
from random import seed
from random import randint
mod = 10 ** 9 + 7

def mul_mod(a, b):
	return a % mod * (b % mod) % mod

def add_mod(a, b):
	return (a % mod + b % mod) % mod

def sub_mod(a, b):
	return (a % mod - b % mod + mod) % mod

def modInverse(b):
	return pow(b, mod - 2, mod)

def div_mod(a, b):
	a = a % mod
	inv = modInverse(b)
	return inv * a % mod

class Graph:

	def __init__(self, vertices):
		self.V = vertices + 1
		self.graph = defaultdict(set)
		self.Time = 0
		self.P = 0
		self.Q = 0

	def addEdge(self, u, v):
		self.graph[u].add(v)
		self.graph[v].add(u)
for _ in range(int(input())):
	n = int(input())
	print('YES' if n % 4 == 0 else 'NO')


from sys import stdin
_input = stdin.readline
(_int, _range) = (int, range)

def solution():
	for _ in _range(_int(_input())):
		n = _int(_input())
		if n % 4 == 0:
			print('YES')
		else:
			print('NO')
solution()


import os
os_input = os.read(0, int(10000000.0)).split()
os_input_pos = -1
answer_list = []

def read_s():
	global os_input_pos
	os_input_pos += 1
	return os_input[os_input_pos].decode()

def read_i():
	return int(read_s())

def write_s(v):
	answer_list.append(v)

def write_i(v):
	write_s(str(v))

def print_ans():
	os.write(1, '\n'.join(answer_list).encode())
	os.write(1, '\n'.encode())
T = read_i()
while T:
	T -= 1
	n = read_i()
	write_s('YES' if n % 4 == 0 else 'NO')
print_ans()


import sys
fast_reader = sys.stdin.readline
fast_writer = sys.stdout.write

def input():
	return fast_reader().strip()

def print(*argv):
	fast_writer(' '.join((str(i) for i in argv)))
	fast_writer('\n')
for _ in range(int(input())):
	n = int(input())
	if n % 4 != 0:
		print('NO')
	else:
		print('YES')


from sys import stdin, stdout
LI = lambda : list(map(int, input().split()))
MAP = lambda : map(int, input().split())
IN = lambda : int(input())
S = lambda : input()
import math

def p(a):
	print(' '.join(list(map(str, a))))
from collections import Counter

def solve():
	n = IN()
	if n % 4:
		print('NO')
	else:
		print('YES')
for i in range(IN()):
	solve()


import os
import sys
from io import BytesIO, IOBase
BUFSIZE = 8192

class FastIO(IOBase):
	newlines = 0

	def __init__(self, file):
		self._fd = file.fileno()
		self.buffer = BytesIO()
		self.writable = 'x' in file.mode or 'r' not in file.mode
		self.write = self.buffer.write if self.writable else None

	def read(self):
		while True:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
			if not b:
				break
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines = 0
		return self.buffer.read()

	def readline(self):
		while self.newlines == 0:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
			self.newlines = b.count(b'\n') + (not b)
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines -= 1
		return self.buffer.readline()

	def flush(self):
		if self.writable:
			os.write(self._fd, self.buffer.getvalue())
			(self.buffer.truncate(0), self.buffer.seek(0))

class IOWrapper(IOBase):

	def __init__(self, file):
		self.buffer = FastIO(file)
		self.flush = self.buffer.flush
		self.writable = self.buffer.writable
		self.write = lambda s: self.buffer.write(s.encode('ascii'))
		self.read = lambda : self.buffer.read().decode('ascii')
		self.readline = lambda : self.buffer.readline().decode('ascii')
(sys.stdin, sys.stdout) = (IOWrapper(sys.stdin), IOWrapper(sys.stdout))
input = lambda : sys.stdin.readline().rstrip('\r\n')

def fact(x):
	if x == 0:
		return 1
	else:
		return x * fact(x - 1)

def lower_bound(li, num):
	answer = -1
	start = 0
	end = len(li) - 1
	while start <= end:
		middle = (end + start) // 2
		if li[middle] >= num:
			answer = middle
			end = middle - 1
		else:
			start = middle + 1
	return answer

def upper_bound(li, num):
	answer = -1
	start = 0
	end = len(li) - 1
	while start <= end:
		middle = (end + start) // 2
		if li[middle] <= num:
			answer = middle
			start = middle + 1
		else:
			end = middle - 1
	return answer

def abs(x):
	return x if x >= 0 else -x

def binary_search(li, val, lb, ub):
	ans = 0
	while lb <= ub:
		mid = (lb + ub) // 2
		if li[mid] > val:
			ub = mid - 1
		elif val > li[mid]:
			lb = mid + 1
		else:
			ans = 1
			break
	return ans

def sieve_of_eratosthenes(n):
	ans = []
	arr = [1] * (n + 1)
	(arr[0], arr[1], i) = (0, 0, 2)
	while i * i <= n:
		if arr[i] == 1:
			j = i + i
			while j <= n:
				arr[j] = 0
				j += i
		i += 1
	for k in range(n):
		if arr[k] == 1:
			ans.append(k)
	return ans

def nc2(x):
	if x == 1:
		return 0
	else:
		return x * (x - 1) // 2
for _ in range(int(input())):
	n = int(input())
	if n % 4 == 0:
		print('YES')
	else:
		print('NO')


test = int(input())
res_list = []
for t in range(test):
	side = int(input())
	if side % 4 == 0:
		res_list.append('YES')
	else:
		res_list.append('NO')
for g in res_list:
	print(g)


import sys
pin = sys.stdin.readline
pout = sys.stdout.write
ran = range
x = int(pin())
for i in ran(x):
	m = int(pin())
	if m % 4 == 0:
		print('Yes')
	else:
		print('No')


for _ in range(int(input())):
	a = int(input())
	if a <= 2:
		print('YES')
	elif a % 4 == 0:
		print('YES')
	else:
		print('NO')


def gns():
	return list(map(int, input().split()))
t = int(input())
for _ in range(t):
	n = int(input())
	if n % 4 == 0:
		print('YES')
	else:
		print('NO')


t = int(input())
for i in range(t):
	n = int(input())
	if n > 3 and n % 4 == 0:
		print('YES')
	else:
		print('NO')


import sys, math, cmath, time
start_time = time.time()

def solve():
	n = inp()
	if n % 4 == 0:
		print('YES')
	else:
		print('NO')

def main():
	global tt
	if not ONLINE_JUDGE:
		sys.stdin = open('input.txt', 'r')
		sys.stdout = open('output.txt', 'w')
	t = 1
	t = inp()
	for tt in range(t):
		solve()
	if not ONLINE_JUDGE:
		print('Time Elapsed :', time.time() - start_time, 'seconds')
		sys.stdout.close()

def inp():
	return int(input())

def inlt():
	return list(map(int, input().split()))

def insr():
	return input().strip()

def invr():
	return map(int, input().split())

def counter(a):
	q = [0] * max(a)
	for i in range(len(a)):
		q[a[i] - 1] = (q[a[i] - 1], 1)
	return q

def string_counter(a):
	q = [0] * 26
	for i in range(len(a)):
		q[ord(a[i]) - 97] = (q[ord(a[i]) - 97], 1)
	return q

def factors(n):
	q = []
	for i in range(1, int(n ** 0.5) + 1):
		if n % i == 0:
			q.append(i)
			q.append(n // i)
	return list(sorted(list(set(q))))

def prime_factors(n):
	q = []
	while n % 2 == 0:
		q.append(2)
		n = n // 2
	for i in range(3, int(n ** 0.5) + 1, 2):
		while n % i == 0:
			q.append(i)
			n = n // i
	if n > 2:
		q.append(n)
	return list(sorted(q))
ONLINE_JUDGE = __debug__
if ONLINE_JUDGE:
	input = sys.stdin.readline
main()


import math
from sys import stdin
from collections import Counter, defaultdict, deque
input = stdin.readline
mod = pow(10, 9) + 7

def solve():
	n = int(input())
	if n % 4 == 0:
		print('YES')
	else:
		print('NO')
for _ in range(int(input())):
	solve()


def solve():
	n = int(input())
	if n % 4 == 0:
		return 'YES'
	return 'NO'

def main():
	t = int(input())
	while t:
		print(solve())
		t -= 1
main()


T = int(input())
while T != 0:
	T -= 1
	n = int(input())
	print('Yes' if n % 4 == 0 else 'NO')


import sys
input = sys.stdin.readline

def int_array():
	return list(map(int, input().strip().split()))

def str_array():
	return input().strip().split()

def lower_letters():
	lowercase = [chr(i) for i in range(97, 97 + 26)]
	return lowercase

def upper_letters():
	uppercase = [chr(i) for i in range(65, 65 + 26)]
	return uppercase
for _ in range(int(input())):
	n = int(input())
	if n % 4 == 0:
		print('YES')
	else:
		print('NO')


n = int(input())
list = []
for i in range(n):
	nums = int(input())
	list.append(nums)
print('\n')
for i in range(n):
	if list[i] % 4 != 0:
		print('NO')
	else:
		print('YES')


def func(n):
	for j in range(n):
		i = int(input())
		if i % 4 == 0:
			print('YES')
		else:
			print('NO')
n = int(input())
func(n)


t = int(input())
while t:
	t = t - 1
	n = int(input())
	if n % 2 == 0 and n % 4 == 0:
		print('YES')
	else:
		print('NO')


a = int(input())
for i in range(a):
	b = int(input())
	if b > 3 and b % 4 == 0:
		print('YES')
	else:
		print('NO')


test = int(input())
for t in range(test):
	num = int(input())
	if num == 3:
		print('NO')
	else:
		num -= 4
		if num % 4 == 0:
			print('YES')
		else:
			print('NO')


import sys
input = sys.stdin.readline
t = int(input())
while t > 0:
	t = t - 1
	a = int(input())
	if a % 4 == 0:
		print('YES')
	else:
		print('NO')


from sys import stdin, gettrace
if gettrace():
	inputi = input
else:

	def input():
		return next(stdin)[:-1]

	def inputi():
		return stdin.buffer.readline()

def main():

	def solve():
		print('YES' if int(inputi()) % 4 == 0 else 'NO')
	t = int(inputi())
	for _ in range(t):
		solve()
main()


testcases = int(input())
list_cases = []
for x in range(testcases):
	list_cases.append(int(input()))
for x in list_cases:
	if x % 4:
		print('NO')
	else:
		print('YES')


t = int(input())
ans = []
for i in range(t):
	n = int(input())
	if n % 4 == 0:
		ans.append('YES')
	else:
		ans.append('NO')
for el in ans:
	print(el)


T = int(input())
while T != 0:
	N = int(input())
	if N % 4 == 0:
		print('YES')
	else:
		print('NO')
	T -= 1


n = int(input())
for i in range(n):
	side = int(input())
	if side % 4 == 0:
		print('YES')
	else:
		print('NO')
exit()


import io
import os
input = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline

def get_str():
	return input().decode().strip()

def rint():
	return map(int, input().split())

def oint():
	return int(input())
t = oint()
for _ in range(t):
	n = oint()
	if n % 4:
		print('NO')
	else:
		print('YES')


import sys

def rs():
	return sys.stdin.readline().rstrip()

def ri():
	return int(sys.stdin.readline())

def ria():
	return list(map(int, sys.stdin.readline().split()))

def ws(s):
	sys.stdout.write(s + '\n')

def wi(n):
	sys.stdout.write(str(n) + '\n')

def wia(a):
	sys.stdout.write(' '.join([str(x) for x in a]) + '\n')

def solve(n):
	return n % 4 == 0

def main():
	for _ in range(ri()):
		n = ri()
		ws('YES' if solve(n) else 'NO')
main()


import sys

def input():
	return sys.stdin.readline().strip()

def iinput():
	return int(input())

def rinput():
	return map(int, sys.stdin.readline().strip().split())

def get_list():
	return list(map(int, sys.stdin.readline().strip().split()))
mod = int(1000000000.0) + 7
for _ in range(iinput()):
	n = iinput()
	if n / 2 % 2 == 0:
		print('YES')
	else:
		print('NO')


def beautiful_plygn(n):
	if n % 4 == 0:
		return 'YES'
	else:
		return 'NO'
t = int(input())
for _ in range(t):
	n = int(input())
	print(beautiful_plygn(n))


import math
x = int(input())
for i in range(x):
	a = int(input())
	if a % 4 == 0:
		print('YES')
	else:
		print('NO')


def poly(n):
	if n % 4 == 0:
		print('YES')
	else:
		print('NO')
for _ in range(int(input())):
	n = int(input())
	poly(n)


import sys
buff_readline = sys.stdin.readline
readline = sys.stdin.readline
INF = 2 ** 62 - 1

def read_int():
	return int(buff_readline())

def read_int_n():
	return list(map(int, buff_readline().split()))

def read_float():
	return float(buff_readline())

def read_float_n():
	return list(map(float, buff_readline().split()))

def read_str():
	return readline().strip()

def read_str_n():
	return readline().strip().split()

def error_print(*args):
	print(*args, file=sys.stderr)

def mt(f):
	import time

	def wrap(*args, **kwargs):
		s = time.time()
		ret = f(*args, **kwargs)
		e = time.time()
		error_print(e - s, 'sec')
		return ret
	return wrap

@mt
def slv(N):
	return 'YES' if N % 4 == 0 else 'NO'

def main():
	T = read_int()
	for _ in range(T):
		N = read_int()
		print(slv(N))
main()


for i in range(int(input())):
	a = int(input())
	if a % 4 == 0:
		print('YES')
		continue
	print('NO')


import os, io
from sys import stdout
import collections
import random
import math
from operator import itemgetter
input = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline

def binomial_coefficient(n, k):
	if 0 <= k <= n:
		ntok = 1
		ktok = 1
		for t in range(1, min(k, n - k) + 1):
			ntok *= n
			ktok *= t
			n -= 1
		return ntok // ktok
	else:
		return 0

def powerOfK(k, max):
	if k == 1:
		return [1]
	if k == -1:
		return [-1, 1]
	result = []
	n = 1
	while n <= max:
		result.append(n)
		n *= k
	return result

def prefixSum(arr):
	for i in range(1, len(arr)):
		arr[i] = arr[i] + arr[i - 1]
	return arr

def divisors(n):
	i = 1
	result = []
	while i * i <= n:
		if n % i == 0:
			if n / i == i:
				result.append(i)
			else:
				result.append(i)
				result.append(n / i)
		i += 1
	return result
t = int(input())
for _ in range(t):
	n = int(input())
	if n % 4 == 0:
		print('YES')
	else:
		print('NO')


for tt in range(int(input())):
	print('NO' if int(input()) % 4 else 'YES')


from sys import stdin

def input():
	return stdin.readline().rstrip()
for _ in range(int(input())):
	n = int(input())
	if n % 4 == 0:
		print('YES')
	else:
		print('NO')


for t in range(int(input())):
	n = int(input())
	if 90 * n % 360 == 0 or 90 * n % 360 == 0:
		print('YES')
	else:
		print('NO')


import sys
import math as mt
input = sys.stdin.buffer.readline
t = int(input())
for _ in range(t):
	n = int(input())
	if n % 4 == 0:
		print('YES')
	else:
		print('NO')


for tt in range(int(input())):
	n = int(input())
	if n % 4 == 0:
		print('Yes')
	else:
		print('No')


t = int(input())
for caseNr in range(1, t + 1):
	n = int(input())
	if (n / 4 - 1).is_integer() and n / 4 - 1 >= 0:
		print('YES')
	else:
		print('NO')


n = int(input())
i = 0
while i < n:
	a = int(input())
	if a % 4 == 0:
		print('yes')
	else:
		print('no')
	i = i + 1


def beautiful():
	n = int(input())
	valor = 0
	vetorSol = []
	while n > 0:
		valor = int(input())
		while valor < 3 or valor > pow(10, 9):
			valor = int(input())
		vetorSol.append(valor)
		n -= 1
	for lados in vetorSol:
		if lados % 4 == 0:
			print('YES')
		else:
			print('NO')
beautiful()


t = int(input())
for i in range(t):
	n = int(input())
	if n % 4 == 0:
		print('YES')
	else:
		print('No')


for test_case in range(int(input())):
	sides = int(input())
	if sides % 4 == 0:
		print('YES')
	else:
		print('NO')


for _ in range(int(input())):
	n = int(input())
	if n == 3:
		print('NO')
		continue
	if n % 2 != 0:
		print('NO')
	elif (n - 2) // 2 % 2 != 0:
		print('YES')
	else:
		print('No')


t = int(input())
poly_array = []
for i in range(t):
	n = int(input())
	poly_array.append(n)
for num in poly_array:
	if num % 4 == 0:
		print('Yes')
	else:
		print('No')


from bisect import *
from collections import *
from math import *
from heapq import *
from typing import List
from itertools import *
from operator import *
from functools import *

@lru_cache(None)
def fact(x):
	if x < 2:
		return 1
	return fact(x - 1) * x

@lru_cache(None)
def per(i, j):
	return fact(i) // fact(i - j)

@lru_cache(None)
def com(i, j):
	return per(i, j) // fact(j)

def linc(f, t, l, r):
	while l < r:
		mid = (l + r) // 2
		if t > f(mid):
			l = mid + 1
		else:
			r = mid
	return l

def rinc(f, t, l, r):
	while l < r:
		mid = (l + r + 1) // 2
		if t < f(mid):
			r = mid - 1
		else:
			l = mid
	return l

def ldec(f, t, l, r):
	while l < r:
		mid = (l + r) // 2
		if t < f(mid):
			l = mid + 1
		else:
			r = mid
	return l

def rdec(f, t, l, r):
	while l < r:
		mid = (l + r + 1) // 2
		if t > f(mid):
			r = mid - 1
		else:
			l = mid
	return l

def isprime(n):
	for i in range(2, int(n ** 0.5) + 1):
		if n % i == 0:
			return False
	return True

def power2(n):
	while not n & 1:
		n >>= 1
	return n == 1
t = int(input())
for i in range(t):
	n = int(input())
	if n % 4 == 0:
		print('YES')
	else:
		print('NO')


num = int(input())
arr = []
for i in range(num):
	arr.append(input())
for i in range(0, len(arr)):
	if int(arr[i]) % 4 == 0:
		print('YES')
	else:
		print('NO')


a = int(input())
c = []
d = 'YES'
e = 'NO'
for i in range(0, a):
	b = int(input())
	if b % 4 == 0:
		c.append(d)
	else:
		c.append(e)
for i in c:
	print(i)


import sys
input = sys.stdin.readline

def solve(n):
	if n <= 2:
		return 'NO'
	if n % 4 == 0:
		return 'YES'
	else:
		return 'NO'
t = int(input())
for _ in range(t):
	n = int(input())
	print(solve(n))


n = int(input())

def beauti(k):
	if k % 4 == 0:
		return 'YES'
	else:
		return 'NO'
for i in range(n):
	k = int(input())
	print(beauti(k))


import sys
import math
from collections import defaultdict, deque
import heapq
mod = 998244353
t = int(sys.stdin.readline())
for _ in range(t):
	n = int(sys.stdin.readline())
	if n % 4 == 0:
		print('YES')
	else:
		print('NO')


import sys
from math import sqrt
input = sys.stdin.readline

def inp():
	return int(input())

def inlist():
	return list(map(int, input().split()))

def instr():
	s = input()
	return list(s[:len(s) - 1])

def invr():
	return map(int, input().split())

def main():
	t = inp()
	for l in range(t):
		n = inp()
		if n % 4 == 0:
			print('YES')
		else:
			print('NO')
main()


import math
import sys
import itertools
import itertools

def sa(Type=int):
	return [Type(x) for x in input().split()]

def solve(t):
	n = int(input())
	print('YES' if n % 4 == 0 else 'NO')
t = int(input())
for i in range(t):
	solve(i + 1)


import sys
from bisect import bisect_left
from collections import defaultdict
input = lambda : sys.stdin.readline().rstrip()
R = lambda : map(int, input().split())
(T,) = R()
for _ in range(T):
	(n,) = R()
	print('YES' if n % 4 == 0 else 'NO')


from copy import *
from math import *
import sys
input = sys.stdin.readline
t = int(input())
for i in range(t):
	n = int(input())
	if n % 4 == 0:
		print('YES')
	else:
		print('NO')


def answer(n):
	if n % 2 != 0:
		return 'NO'
	else:
		x = n // 2
		if x % 2 == 0:
			return 'YES'
		else:
			return 'NO'
t = int(input())
for i in range(t):
	n = int(input())
	print(answer(n))


t = int(input())
for i in range(t):
	n = int(input())
	if n % 4:
		print('No')
	else:
		print('Yes')


import math

def main():
	n = int(input())
	if n % 4:
		print('NO')
	else:
		print('YES')
t = int(input())
for i in range(t):
	main()


from math import ceil
from math import radians
from heapq import heapify, heappush, heappop
import bisect
from math import pi
from collections import deque
from math import factorial
from math import log, ceil
from collections import defaultdict
from math import *
from sys import stdin, stdout
import itertools
import os
import sys
import threading
from collections import deque, Counter, OrderedDict, defaultdict
from heapq import *
from fractions import Fraction
mod = int(pow(10, 9) + 7)

def ii():
	return int(input())

def si():
	return str(input())

def mi():
	return map(int, input().split())

def li1():
	return list(mi())

def fii():
	return int(stdin.readline())

def fsi():
	return str(stdin.readline())

def fmi():
	return map(int, stdin.readline().split())

def fli():
	return list(fmi())
abd = {'a': 0, 'b': 1, 'c': 2, 'd': 3, 'e': 4, 'f': 5, 'g': 6, 'h': 7, 'i': 8, 'j': 9, 'k': 10, 'l': 11, 'm': 12, 'n': 13, 'o': 14, 'p': 15, 'q': 16, 'r': 17, 's': 18, 't': 19, 'u': 20, 'v': 21, 'w': 22, 'x': 23, 'y': 24, 'z': 25}

def getKey(item):
	return item[0]

def sort2(l):
	return sorted(l, key=getKey)

def d2(n, m, num):
	return [[num for x in range(m)] for y in range(n)]

def isPowerOfTwo(x):
	return x and (not x & x - 1)

def decimalToBinary(n):
	return bin(n).replace('0b', '')

def ntl(n):
	return [int(i) for i in str(n)]

def powerMod(x, y, p):
	res = 1
	x %= p
	while y > 0:
		if y & 1:
			res = res * x % p
		y = y >> 1
		x = x * x % p
	return res
graph = defaultdict(list)
visited = [0] * 1000000
col = [-1] * 1000000

def bfs(d, v):
	q = []
	q.append(v)
	visited[v] = 1
	while len(q) != 0:
		x = q[0]
		q.pop(0)
		for i in d[x]:
			if visited[i] != 1:
				visited[i] = 1
				q.append(i)
		print(x)

def make_graph(e):
	d = {}
	for i in range(e):
		(x, y) = mi()
		if x not in d:
			d[x] = [y]
		else:
			d[x].append(y)
		if y not in d:
			d[y] = [x]
		else:
			d[y].append(x)
	return d

def gr2(n):
	d = defaultdict(list)
	for i in range(n):
		(x, y) = mi()
		d[x].append(y)
	return d

def connected_components(graph):
	seen = set()

	def dfs(v):
		vs = set([v])
		component = []
		while vs:
			v = vs.pop()
			seen.add(v)
			vs |= set(graph[v]) - seen
			component.append(v)
		return component
	ans = []
	for v in graph:
		if v not in seen:
			d = dfs(v)
			ans.append(d)
	return ans

def primeFactors(n):
	s = set()
	while n % 2 == 0:
		n = n // 2
	for i in range(3, int(sqrt(n)) + 1, 2):
		while n % i == 0 and i % 2 == 1:
			s.add(i)
			n = n // i
	if n > 2 and n % 2 == 1:
		s.add(n)
	return s

def find_all(a_str, sub):
	start = 0
	while True:
		start = a_str.find(sub, start)
		if start == -1:
			return
		yield start
		start += len(sub)

def SieveOfEratosthenes(n, isPrime):
	isPrime[0] = isPrime[1] = False
	for i in range(2, n):
		isPrime[i] = True
	p = 2
	while p * p <= n:
		if isPrime[p] == True:
			i = p * p
			while i <= n:
				isPrime[i] = False
				i += p
		p += 1
	return isPrime

def dijkstra(edges, f, t):
	g = defaultdict(list)
	for (l, r, c) in edges:
		g[l].append((c, r))
	(q, seen, mins) = ([(0, f, ())], set(), {f: 0})
	while q:
		(cost, v1, path) = heappop(q)
		if v1 not in seen:
			seen.add(v1)
			path = (v1, path)
			if v1 == t:
				return (cost, path)
			for (c, v2) in g.get(v1, ()):
				if v2 in seen:
					continue
				prev = mins.get(v2, None)
				next = cost + c
				if prev is None or next < prev:
					mins[v2] = next
					heappush(q, (next, v2, path))
	return float('inf')

def binsearch(a, l, r, x):
	while l <= r:
		mid = l + (r - 1) // 2
		if a[mid]:
			return mid
		elif a[mid] > x:
			l = mid - 1
		else:
			r = mid + 1
	return -1

def readTree(n):
	adj = [set() for _ in range(n)]
	for _ in range(n - 1):
		(u, v) = map(int, input().split())
		adj[u - 1].add(v - 1)
		adj[v - 1].add(u - 1)
	return adj

def treeOrderByDepth(n, adj, root=0):
	parent = [-2] + [-1] * (n - 1)
	ordered = []
	q = deque()
	q.append(root)
	depth = [0] * n
	while q:
		c = q.popleft()
		ordered.append(c)
		for a in adj[c]:
			if parent[a] == -1:
				parent[a] = c
				depth[a] = depth[c] + 1
				q.append(a)
	return (ordered, parent, depth)

def isSubSequence(str1, str2):
	m = len(str1)
	n = len(str2)
	j = 0
	i = 0
	while j < m and i < n:
		if str1[j] == str2[i]:
			j = j + 1
		i = i + 1
	return j == m

def nextPowerOf2(n):
	count = 0
	if n and (not n & n - 1):
		return n
	while n != 0:
		n >>= 1
		count += 1
	return 1 << count

def cou(n):
	c = 0
	while n > 1:
		c += 1
		n //= 2
	return c

def dfsques(d, x, visited, a, b, m):
	visited[x] = 1
	q = [x]
	c = 1
	cost = m
	pro = [x]
	while q:
		y = q.pop(0)
		for i in d[y]:
			if visited[i] == 0 and (cost * c + a[i - 1]) / (c + b[i - 1]) >= cost:
				q.append(i)
				cost = (cost * c + a[i - 1]) / (c + 1)
				visited[i] = 1
				pro.append(i)
	return (cost, pro)
for _ in range(ii()):
	n = ii()
	if n % 4 == 0:
		print('YES')
	else:
		print('NO')


from sys import stdin, stdout
t_case = int(stdin.readline())
for t in range(t_case):
	d = int(stdin.readline())
	if d % 4 == 0:
		print('YES')
	else:
		print('NO')


n = int(input())
l = []
for i in range(n):
	l.append(int(input()))
for j in l:
	ia = 90 * j / 360
	if ia % 1 == 0:
		print('YES')
	else:
		print('NO')


numTestCases = int(input())
cases = []
for i in range(numTestCases):
	cases.append(int(input()))
for i in range(len(cases)):
	currCase = cases[i]
	if currCase % 4 == 0:
		print('YES')
	else:
		print('NO')


t = int(input())
li = []
for i in range(t):
	li = li + [int(input())]
for j in li:
	if j % 4 == 0:
		print('YES')
	else:
		print('NO')


t = int(input())
for k in range(t):
	a = []
	n = int(input())
	if n % 4 == 0:
		print('YES')
	else:
		print('NO')


import sys
input = sys.stdin.readline

def inp():
	return int(input())

def inlt():
	return list(map(int, input().split()))

def insr():
	s = input()
	return s[:len(s) - 1]

def invr():
	return map(int, input().split())

def solve(t):
	if t % 4 == 0:
		print('YES')
	else:
		print('NO')
T = inp()
tests = []
for _ in range(T):
	tests.append(inp())
for t in tests:
	solve(t)


def read_int():
	return int(input())

def read_string_array():
	return input().split()

def read_int_array():
	return [int(_) for _ in read_string_array()]

def read_line():
	return input()
import fractions

def solve(n):
	if fractions.Fraction(90) % (fractions.Fraction(360) / fractions.Fraction(n)):
		return 'NO'
	else:
		return 'YES'
T = read_int()
for _ in range(T):
	N = read_int()
	print(solve(N))


from fractions import Fraction
from collections import defaultdict
import math
import os
import sys
from io import BytesIO, IOBase
BUFSIZE = 8192

class FastIO(IOBase):
	newlines = 0

	def __init__(self, file):
		self._fd = file.fileno()
		self.buffer = BytesIO()
		self.writable = 'x' in file.mode or 'r' not in file.mode
		self.write = self.buffer.write if self.writable else None

	def read(self):
		while True:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
			if not b:
				break
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines = 0
		return self.buffer.read()

	def readline(self):
		while self.newlines == 0:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
			self.newlines = b.count(b'\n') + (not b)
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines -= 1
		return self.buffer.readline()

	def flush(self):
		if self.writable:
			os.write(self._fd, self.buffer.getvalue())
			(self.buffer.truncate(0), self.buffer.seek(0))

class IOWrapper(IOBase):

	def __init__(self, file):
		self.buffer = FastIO(file)
		self.flush = self.buffer.flush
		self.writable = self.buffer.writable
		self.write = lambda s: self.buffer.write(s.encode('ascii'))
		self.read = lambda : self.buffer.read().decode('ascii')
		self.readline = lambda : self.buffer.readline().decode('ascii')
(sys.stdin, sys.stdout) = (IOWrapper(sys.stdin), IOWrapper(sys.stdout))

def input():
	return sys.stdin.readline().rstrip('\r\n')
t = int(input())
krish = 1000
ans = 100
res = 90
for _ in range(t):
	n = int(input())
	if n <= 3:
		print('NO')
	elif n % 2 == 1:
		print('NO')
	elif n % 4 == 0:
		print('YES')
	else:
		print('NO')
	res -= 1


import math
from collections import *
import sys
from functools import reduce

def get_ints():
	return map(int, input().strip().split())

def get_list():
	return list(get_ints())

def get_string():
	return list(input().strip().split())

def printxsp(*args):
	return print(*args, end='')

def printsp(*args):
	return print(*args, end=' ')
UGLYMOD = int(1000000000.0) + 7
SEXYMOD = 998244353
MAXN = int(100000.0)
for _testcases_ in range(int(input())):
	print('YES' if not int(input()) % 4 else 'NO')


for _ in range(int(input())):
	print(['No', 'Yes'][int(input()) % 4 == 0])


from sys import stdin
input = stdin.readline

def main():
	test = int(input())
	for _ in range(test):
		n = int(input())
		if n % 4 != 0:
			print('NO')
		else:
			print('YES')
main()


for t in range(int(input())):
	print('YES' if not int(input()) % 4 else 'NO')


for _ in range(int(input())):
	x = int(input())
	if x > 3 and x % 4 == 0:
		print('YES')
	else:
		print('NO')


from collections import deque
import sys

def inp():
	return sys.stdin.readline().strip()
for _ in range(int(inp())):
	n = int(inp())
	if n % 4 == 0:
		print('YES')
	else:
		print('NO')


from collections import *
from bisect import *
from math import *
for _ in range(int(input())):
	n = int(input())
	if n % 4 == 0:
		print('YES')
	else:
		print('NO')


from sys import stdin, stdout

def II():
	return int(stdin.readline())
t = II()
for _ in range(t):
	n = II()
	if n % 4 == 0:
		stdout.write('YES\n')
	else:
		stdout.write('NO\n')


def solve(n):
	return 'YES' if n % 4 == 0 else 'NO'
t = int(input())
for i_t in range(t):
	n = int(input())
	print(solve(n))


tests = int(input())
results = []
for i in range(tests):
	num = int(input())
	if num % 4 == 0:
		results.append('YES')
	else:
		results.append('NO')
for i in results:
	print(i)


import sys
t = int(input())
for _t in range(t):
	n = int(sys.stdin.readline())
	print('No' if n % 4 else 'Yes')


for x in range(int(input())):
	liczba = int(input())
	if liczba % 4 == 0:
		print('YES')
	else:
		print('NO')


import sys
from os import path
if path.exists('C:/Users/prana/Desktop/sublime/input.txt'):
	sys.stdin = open('C:/Users/prana/Desktop/sublime/input.txt', 'r')
	sys.stdout = open('C:/Users/prana/Desktop/sublime/output.txt', 'w')

def solve():
	n = int(input())
	if n % 4 == 0:
		print('YES')
	else:
		print('NO')
T = 1
T = int(input())
for _ in range(1, T + 1):
	print('Case #', _, file=sys.stderr)
	solve()


num_poly = int(input())
for i in range(num_poly):
	poly = int(input())
	if poly == 3 or poly == 5 or poly == 6:
		print('NO')
	else:
		r = poly - 2
		if r / 2 % 2 == 1:
			print('YES')
		else:
			print('NO')


result = []
for _ in range(int(input())):
	i = int(input())
	if i % 4 == 0:
		result.append('YES')
	else:
		result.append('NO')
for j in result:
	print(j)


for _ in range(int(input())):
	n = int(input())
	if n <= 3:
		print('NO')
		continue
	if n % 4 == 0:
		print('YES')
	else:
		print('NO')


n = int(input())
for j in range(0, n):
	a = list(map(int, input().split()))
	for i in range(len(a)):
		if a[i] % 4 == 0:
			print('YES')
		else:
			print('NO')


from __future__ import division, print_function
import os, sys
import math
import collections
from io import BytesIO, IOBase
if sys.version_info[0] < 3:
	from __builtin__ import xrange as range
	from future_builtins import ascii, filter, hex, map, oct, zip

def ii():
	return int(input())

def si():
	return input()

def mi():
	return map(int, input().strip().split(' '))

def msi():
	return map(str, input().strip().split(' '))

def li():
	return list(mi())

def dmain():
	sys.setrecursionlimit(100000000)
	threading.stack_size(40960000)
	thread = threading.Thread(target=main)
	thread.start()
abc = 'abcdefghijklmnopqrstuvwxyz'
abd = {'a': 0, 'b': 1, 'c': 2, 'd': 3, 'e': 4, 'f': 5, 'g': 6, 'h': 7, 'i': 8, 'j': 9, 'k': 10, 'l': 11, 'm': 12, 'n': 13, 'o': 14, 'p': 15, 'q': 16, 'r': 17, 's': 18, 't': 19, 'u': 20, 'v': 21, 'w': 22, 'x': 23, 'y': 24, 'z': 25}
mod = 1000000007
inf = float('inf')
vow = ['a', 'e', 'i', 'o', 'u']
(dx, dy) = ([-1, 1, 0, 0], [0, 0, 1, -1])

def getKey(item):
	return item[1]

def sort2(l):
	return sorted(l, key=getKey, reverse=True)

def d2(n, m, num):
	return [[num for x in range(m)] for y in range(n)]

def isPowerOfTwo(x):
	return x and (not x & x - 1)

def decimalToBinary(n):
	return bin(n).replace('0b', '')

def ntl(n):
	return [int(i) for i in str(n)]

def ncr(n, r):
	return factorial(n) // (factorial(r) * factorial(n - r))

def binary_search(arr, low, high, x):
	if high >= low:
		mid = (high + low) // 2
		if arr[mid] == x:
			return mid
		elif arr[mid] > x:
			return binary_search(arr, low, mid - 1, x)
		else:
			return binary_search(arr, mid + 1, high, x)
	else:
		return -1

def ceil(x, y):
	if x % y == 0:
		return x // y
	else:
		return x // y + 1

def powerMod(x, y, p):
	res = 1
	x %= p
	while y > 0:
		if y & 1:
			res = res * x % p
		y = y >> 1
		x = x * x % p
	return res

def gcd(x, y):
	while y:
		(x, y) = (y, x % y)
	return x

def isPrime(n):
	if n <= 1:
		return False
	if n <= 3:
		return True
	if n % 2 == 0 or n % 3 == 0:
		return False
	i = 5
	while i * i <= n:
		if n % i == 0 or n % (i + 2) == 0:
			return False
		i = i + 6
	return True

def read():
	sys.stdin = open('input.txt', 'r')
	sys.stdout = open('output.txt', 'w')

def padded_bin_with_complement(x):
	if x < 0:
		return bin(2 ** 16 - abs(x))[2:].zfill(16)
	else:
		return bin(x)[2:].zfill(16)

def binaryToDecimal(binary):
	binary1 = binary
	(decimal, i, n) = (0, 0, 0)
	while binary != 0:
		dec = binary % 10
		decimal = decimal + dec * pow(2, i)
		binary = binary // 10
		i += 1
	print(decimal)

def CountFrequency(arr):
	return collections.Counter(arr)

def pos(a):
	b = [0] * len(a)
	c = sorted(a)
	for i in range(len(a)):
		for j in range(len(a)):
			if c[j] == a[i]:
				b[i] = j
				break
	return b

def smallestDivisor(n):
	if n % 2 == 0:
		return 2
	i = 3
	while i * i <= n:
		if n % i == 0:
			return i
		i += 2
	return n

def commonn(a, b, n):
	c = []
	for i in range(n):
		if a[i] == b[i]:
			c.append('-1')
		else:
			c.append(b[i])
	return c

def primeFactors(n):
	j = []
	while n % 2 == 0:
		j.append(2)
		n = n / 2
	for i in range(3, int(math.sqrt(n)) + 1, 2):
		while n % i == 0:
			j.append(int(n))
			n = n / i
	if n > 2:
		j.append(int(n))
	return j

def main():
	for _ in range(ii()):
		n = ii()
		if n < 4:
			print('NO')
		elif n % 4 == 0:
			print('YES')
		else:
			print('NO')
BUFSIZE = 8192

class FastIO(IOBase):
	newlines = 0

	def __init__(self, file):
		self._fd = file.fileno()
		self.buffer = BytesIO()
		self.writable = 'x' in file.mode or 'r' not in file.mode
		self.write = self.buffer.write if self.writable else None

	def read(self):
		while True:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
			if not b:
				break
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines = 0
		return self.buffer.read()

	def readline(self):
		while self.newlines == 0:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
			self.newlines = b.count(b'\n') + (not b)
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines -= 1
		return self.buffer.readline()

	def flush(self):
		if self.writable:
			os.write(self._fd, self.buffer.getvalue())
			(self.buffer.truncate(0), self.buffer.seek(0))

class IOWrapper(IOBase):

	def __init__(self, file):
		self.buffer = FastIO(file)
		self.flush = self.buffer.flush
		self.writable = self.buffer.writable
		self.write = lambda s: self.buffer.write(s.encode('ascii'))
		self.read = lambda : self.buffer.read().decode('ascii')
		self.readline = lambda : self.buffer.readline().decode('ascii')

def print(*args, **kwargs):
	(sep, file) = (kwargs.pop('sep', ' '), kwargs.pop('file', sys.stdout))
	at_start = True
	for x in args:
		if not at_start:
			file.write(sep)
		file.write(str(x))
		at_start = False
	file.write(kwargs.pop('end', '\n'))
	if kwargs.pop('flush', False):
		file.flush()
if sys.version_info[0] < 3:
	(sys.stdin, sys.stdout) = (FastIO(sys.stdin), FastIO(sys.stdout))
else:
	(sys.stdin, sys.stdout) = (IOWrapper(sys.stdin), IOWrapper(sys.stdout))
input = lambda : sys.stdin.readline().rstrip('\r\n')
main()


from sys import stdout
import math
t = int(input())
for _ in range(t):
	n = int(input())
	if n % 4 == 0:
		print('YES')
	else:
		print('NO')


t = int(input())
for _ in range(t):
	n = int(input())
	if n % 4 == 0:
		print('Yes')
	else:
		print('NO')


import sys

def main():
	nb = int(sys.stdin.readline())
	for _ in range(nb):
		n = int(sys.stdin.readline())
		print('YES' if n % 4 == 0 else 'NO')
main()


from sys import stdin, stdout
from math import gcd, sqrt
from collections import deque
input = stdin.readline
R = lambda : map(int, input().split())
I = lambda : int(input())
S = lambda : input().rstrip('\n')
L = lambda : list(R())
P = lambda x: stdout.write(x)
hg = lambda x, y: (y + x - 1) // x * x
pw = lambda x: 1 if x == 1 else 1 + pw(x // 2)
chk = lambda x: chk(x // 2) if not x % 2 else True if x == 1 else False
N = 10 ** 6 + 7
for _ in range(I()):
	if I() % 4:
		print('NO')
	else:
		print('YES')


t = int(input())
i = 0
A = []
while 0 <= i < t:
	i = i + 1
	n = int(input())
	if n % 4 == 0:
		A.append('YES')
	else:
		A.append('NO')
k = -1
while -1 <= k < t - 1:
	k = k + 1
	print(A[k])


from sys import stdin
for _ in range(int(stdin.readline())):
	n = int(stdin.readline())
	if not n % 4:
		print('YES')
	else:
		print('NO')


T = int(input())
for test in range(T):
	n = int(input())
	if n % 4 == 0:
		print('YES')
	else:
		print('NO')


import sys
input = lambda : sys.stdin.readline().rstrip('\r\n')
for _ in range(int(input())):
	n = int(input())
	if n % 4 == 0:
		print('YES')
	else:
		print('NO')


import sys
infile = sys.stdin
next(infile)
for line in infile:
	n = int(line)
	if n % 4 == 0:
		print('YES')
	else:
		print('NO')


from sys import stdin, stdout
import heapq
import cProfile
from collections import Counter, defaultdict, deque
from functools import reduce
import math
from bisect import bisect, bisect_right, bisect_left

def get_int():
	return int(stdin.readline().strip())

def get_tuple():
	return map(int, stdin.readline().split())

def get_list():
	return list(map(int, stdin.readline().split()))

def solve():
	n = get_int()
	if n % 4 == 0:
		return 'YES'
	return 'NO'

def main():
	print(solve())
TestCases = True
if TestCases:
	for i in range(get_int()):
		main()
else:
	main()


def f(x):
	if x % 4 == 0:
		return True
	return False
for tc in range(int(input())):
	if f(int(input())):
		print('YES')
	else:
		print('NO')


n = int(input())
l = []
for i in range(n):
	z = int(input())
	if z % 4 == 0:
		l.append('YES')
	else:
		l.append('No')
for k in l:
	print(k)


for i in range(int(input())):
	n = int(input())
	a = (n - 2) * 180
	if 90 * n % (180 * n - a) == 0:
		print('Yes')
	else:
		print('No')


import math, sys
from sys import stdin, stdout
from collections import Counter, defaultdict, deque
input = stdin.readline
I = lambda : int(input())
li = lambda : list(map(int, input().split()))

def solve():
	n = I()
	if n % 4 == 0:
		print('YES')
	else:
		print('NO')
for _ in range(I()):
	solve()


t = int(input())
for i in range(0, t):
	x = int(input())
	print('{} '.format('YES' if x % 4 == 0 else 'NO'))


n = int(input())
ans = []
for i in range(n):
	m = int(input())
	if m % 4 == 0:
		ans.append('YES')
	else:
		ans.append('NO')
print('\n'.join(ans))


def r(n):
	if n % 4 == 0:
		return 'YES'
	return 'NO'
for i in range(int(input())):
	n = int(input())
	print(r(n))


from __future__ import division, print_function
from sys import stdin, stdout
import bisect
from bisect import bisect_left as bl
from bisect import bisect_right as br
import itertools
from collections import Counter
import collections
import math
import heapq
import re

def modinv(n, p):
	return pow(n, p - 2, p)

def cin():
	return map(int, sin().split())

def ain():
	return list(map(int, sin().split()))

def sin():
	return input()

def inin():
	return int(input())

def Divisors(n):
	l = []
	for i in range(1, int(math.sqrt(n) + 1)):
		if n % i == 0:
			if n // i == i:
				l.append(i)
			else:
				l.append(i)
				l.append(n // i)
	return l

def most_frequent(list):
	return max(set(list), key=list.count)

def GCD(x, y):
	while y:
		(x, y) = (y, x % y)
	return x

def ncr(n, r, p):
	t = fact[n] * (ifact[r] * ifact[n - r] % p) % p
	return t

def Convert(string):
	li = list(string.split(''))
	return li

def SieveOfEratosthenes(n):
	global prime
	prime = [True for i in range(n + 1)]
	p = 2
	while p * p <= n:
		if prime[p] == True:
			for i in range(p * p, n + 1, p):
				prime[i] = False
		p += 1
	f = []
	for p in range(2, n):
		if prime[p]:
			f.append(p)
	return f
prime = []
q = []

def dfs(n, d, v, c):
	global q
	v[n] = 1
	x = d[n]
	q.append(n)
	j = c
	for i in x:
		if i not in v:
			f = dfs(i, d, v, c + 1)
			j = max(j, f)
	return j

def main():
	for _ in range(inin()):
		n = inin()
		if n % 4 == 0:
			print('YES')
		else:
			print('NO')
py2 = round(0.5)
if py2:
	from future_builtins import ascii, filter, hex, map, oct, zip
	range = xrange
import os, sys
from io import IOBase, BytesIO
BUFSIZE = 8192

class FastIO(BytesIO):
	newlines = 0

	def __init__(self, file):
		self._file = file
		self._fd = file.fileno()
		self.writable = 'x' in file.mode or 'w' in file.mode
		self.write = super(FastIO, self).write if self.writable else None

	def _fill(self):
		s = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
		self.seek((self.tell(), self.seek(0, 2), super(FastIO, self).write(s))[0])
		return s

	def read(self):
		while self._fill():
			pass
		return super(FastIO, self).read()

	def readline(self):
		while self.newlines == 0:
			s = self._fill()
			self.newlines = s.count(b'\n') + (not s)
		self.newlines -= 1
		return super(FastIO, self).readline()

	def flush(self):
		if self.writable:
			os.write(self._fd, self.getvalue())
			(self.truncate(0), self.seek(0))

class IOWrapper(IOBase):

	def __init__(self, file):
		self.buffer = FastIO(file)
		self.flush = self.buffer.flush
		self.writable = self.buffer.writable
		if py2:
			self.write = self.buffer.write
			self.read = self.buffer.read
			self.readline = self.buffer.readline
		else:
			self.write = lambda s: self.buffer.write(s.encode('ascii'))
			self.read = lambda : self.buffer.read().decode('ascii')
			self.readline = lambda : self.buffer.readline().decode('ascii')
(sys.stdin, sys.stdout) = (IOWrapper(sys.stdin), IOWrapper(sys.stdout))
input = lambda : sys.stdin.readline().rstrip('\r\n')
main()


def read_int():
	n = int(input())
	return n

def read_ints():
	ints = [int(x) for x in input().split(' ')]
	return ints

def solve(n):
	if n % 4 == 0:
		return 'YES'
	return 'NO'
t = read_int()
for case in range(t):
	n = read_int()
	sol = solve(n)
	print(sol)


def is_beautiful(n):
	return True if not n % 4 else False
test_cases = int(input())
while test_cases:
	print('YES' if is_beautiful(int(input())) else 'NO')
	test_cases -= 1


a = input()
a = int(a)
for i in range(1, a + 1):
	b = input()
	b = int(b)
	if b % 4 == 0:
		print('YES')
	else:
		print('NO')


from os import path
import sys
from functools import cmp_to_key as ctk
from collections import deque, defaultdict as dd
from bisect import bisect, bisect_left, bisect_right, insort, insort_left, insort_right
from itertools import permutations
from datetime import datetime
from math import ceil, sqrt, log, gcd

def ii():
	return int(input())

def si():
	return input()

def mi():
	return map(int, input().split())

def li():
	return list(mi())
abc = 'abcdefghijklmnopqrstuvwxyz'
mod = 1000000007
inf = float('inf')
vow = ['a', 'e', 'i', 'o', 'u']
(dx, dy) = ([-1, 1, 0, 0], [0, 0, 1, -1])

def bo(i):
	return ord(i) - ord('a')

def solve():
	for _ in range(ii()):
		n = ii()
		if n % 4 == 0:
			print('YES')
		else:
			print('NO')
if path.exists('input.txt'):
	sys.stdin = open('input.txt', 'r')
	sys.stdout = open('output.txt', 'w')
else:
	input = sys.stdin.readline
solve()


import sys, io, os, time
from collections import defaultdict
from collections import OrderedDict
from collections import deque
from itertools import combinations
from itertools import permutations
import bisect, math, heapq
alphabet = 'abcdefghijklmnopqrstuvwxyz'
input = sys.stdin.readline
for ii in range(int(input())):
	n = int(input())
	if n % 4 == 0:
		print('YES')
	else:
		print('NO')


for _ in range(int(input())):
	if int(input()) % 4 == 0:
		print('yes')
	else:
		print('no')


def isBeu(x):
	if x % 2 == 0 and (x - 2) // 2 % 2:
		return 'YES'
	return 'NO'
for i in range(int(input())):
	print(isBeu(int(input())))


from sys import stdin, stdout
int_in = lambda : int(stdin.readline())
arr_in = lambda : [int(x) for x in stdin.readline().split()]
mat_in = lambda rows: [arr_in() for _ in range(rows)]
str_in = lambda : stdin.readline().strip()
out = lambda o: stdout.write('{}\n'.format(o))
arr_out = lambda o: out(' '.join(map(str, o)))
bool_out = lambda o: out('YES' if o else 'NO')
tests = lambda : range(1, int_in() + 1)
case_out = lambda i, o: out('Case #{}: {}'.format(i, o))

def solve(n):
	return n % 4 == 0
for i in tests():
	n = int_in()
	bool_out(solve(n))


n = int(input())
list_ = []
for i in range(n):
	int_ = int(input())
	list_.append(int_)
for i in list_:
	if i % 4 == 0:
		print('YES')
	else:
		print('NO')


tot = int(input().strip())
while tot > 0:
	n = int(input().strip())
	if n % 4 == 0:
		print('YES')
	else:
		print('NO')
	tot -= 1


def main():
	t = int(input())
	for case in range(t):
		n = int(input())
		if n / 4 - int(n / 4) == 0:
			print('yes')
		else:
			print('no')
main()


import sys
import math
import collections

def set_debug(debug_mode=False):
	if debug_mode:
		fin = open('input.txt', 'r')
		sys.stdin = fin

def int_input():
	return list(map(int, input().split()))

def get(s):
	return str(s % 9) + '9' * (s // 9)
t = int(input())
for ti in range(1, t + 1):
	n = int(input())
	if n % 4 == 0:
		print('YES')
	else:
		print('NO')


k = int(input())
ans = []
for i in range(k):
	n = input()
	if len(n) > 1:
		lo = int(n[-1])
		lt = int(n[-2])
		ld = int(n[-2:])
		if lo == 0 and lt == 0 or ld % 4 == 0:
			ans.append('YES')
		else:
			ans.append('NO')
	else:
		lo = int(n[-1])
		if lo % 4 == 0:
			ans.append('YES')
		else:
			ans.append('NO')
for el in ans:
	print(el)


t = int(input())
for u in range(t):
	n = int(input())
	if n % 2 == 0 and (n - 2) / 2 % 2 == 1:
		print('YES')
	else:
		print('NO')


t = int(input())
for i in range(t):
	a = int(input())
	if a % 2 == 0 and a / 2 % 2 == 0:
		print('YES')
	else:
		print('NO')


import math, string, itertools, fractions, heapq, collections, re, array, bisect, sys, copy, functools
sys.setrecursionlimit(10 ** 7)
inf = 10 ** 20
eps = 1.0 / 10 ** 10
mod = 10 ** 9 + 7
mod2 = 998244353
dd = [(-1, 0), (0, 1), (1, 0), (0, -1)]
ddn = [(-1, 0), (-1, 1), (0, 1), (1, 1), (1, 0), (1, -1), (0, -1), (-1, -1)]

def LI():
	return list(map(int, sys.stdin.readline().split()))

def LLI():
	return [list(map(int, l.split())) for l in sys.stdin.readlines()]

def LI_():
	return [int(x) - 1 for x in sys.stdin.readline().split()]

def LF():
	return [float(x) for x in sys.stdin.readline().split()]

def LS():
	return sys.stdin.readline().split()

def I():
	return int(sys.stdin.readline())

def F():
	return float(sys.stdin.readline())

def S():
	return input()

def pf(s):
	return print(s, flush=True)

def pe(s):
	return print(str(s), file=sys.stderr)

def JA(a, sep):
	return sep.join(map(str, a))

def JAA(a, s, t):
	return s.join((t.join(map(str, b)) for b in a))

def main():
	t = I()
	rr = []
	for _ in range(t):
		n = I()
		if n % 4 == 0:
			rr.append('YES')
		else:
			rr.append('NO')
	return JA(rr, '\n')
print(main())


N = int(input())
for _ in range(N):
	t = int(input())
	if t % 4 == 0:
		print('YES')
	else:
		print('NO')


import math
import os
import random
import re
import sys
import heapq
t = int(input())
while t > 0:
	t -= 1
	n = int(input())
	if n % 4:
		print('NO')
	else:
		print('YES')


from sys import stdin

def r():
	return stdin.readline().strip()

def r_t(tp):
	return map(tp, r().strip().split())

def r_a(tp):
	return list(r_t(tp))

def main():
	cases = int(r())
	for case in range(cases):
		n = int(r())
		if n % 4 == 0:
			print('YES')
		else:
			print('NO')
main()


test = int(input())

def solve():
	n = int(input())
	if n <= 3:
		print('No')
		return
	elif (n - 4) % 4 == 0:
		print('Yes')
	else:
		print('No')
while test:
	solve()
	test -= 1


test = int(input())
while test != 0:
	if int(input()) % 4 == 0:
		print('YES')
	else:
		print('NO')
	test -= 1


t = int(input())
l = []
for i in range(t):
	l.append(int(input()))
for i in l:
	n = i / 2
	if n % 2 == 0:
		print('YES')
	else:
		print('NO')


import sys, math, os
from io import BytesIO, IOBase
from collections import defaultdict as dd, deque, Counter

def data():
	return sys.stdin.readline().strip()

def mdata():
	return list(map(int, data().split()))

def outl(var):
	sys.stdout.write('\n'.join(map(str, var)) + '\n')

def out(var):
	sys.stdout.write(str(var) + '\n')
INF = float('inf')
mod = 998244353
for t in range(int(data())):
	n = int(data())
	print('YES' if n % 4 == 0 else 'NO')


t = int(input())
full = 360.0
for i in range(1, t + 1):
	n = int(input())
	factor = int(90 * n / 360)
	if factor * 360 == 90 * n:
		print('YES')
	else:
		print('NO')


import sys
T = int(sys.stdin.readline())
for _ in range(T):
	n = int(sys.stdin.readline())
	print('NO' if n % 4 else 'YES')


num = int(input())
l = []
for i in range(num):
	current = int(input())
	if current % 4 == 0:
		l += ['YES']
	else:
		l += ['NO']
for i in range(num):
	print(l[i])


from math import sqrt
from math import floor

def solve():
	n = int(input())
	if n % 4 == 0:
		print('YES')
	else:
		print('NO')
for cnt in range(int(input())):
	solve()


numberOfCases = int(input())
testCases = []
while numberOfCases:
	case = int(input())
	testCases.append(case)
	numberOfCases = numberOfCases - 1
for case in testCases:
	if case % 4 == 0:
		print('YES')
	else:
		print('NO')


N = int(input())
for loop in range(N):
	x = int(input())
	if x % 4 == 0:
		print('YES')
	else:
		print('NO')


a = int(input())
x = []
for i in range(0, a):
	b = int(input())
	x.append(b)
for j in x:
	if j % 4 == 0:
		print('YES')
	else:
		print('NO')


import time, math, bisect, sys
from sys import stdin, stdout
from collections import deque
from fractions import Fraction
from collections import Counter
from collections import OrderedDict
pi = 3.141592653589793

def II():
	return int(stdin.readline())

def IO():
	return stdin.readline()

def IP():
	return map(int, stdin.readline().split())

def L():
	return list(map(int, stdin.readline().split()))

def P(x):
	return stdout.write(str(x))

def PI(x, y):
	return stdout.write(str(x) + ' ' + str(y) + '\n')

def lcm(a, b):
	return a * b // gcd(a, b)

def gcd(a, b):
	if a == 0:
		return b
	elif b == 0:
		return a
	if a > b:
		return gcd(a % b, b)
	else:
		return gcd(a, b % a)

def readTree():
	v = int(input())
	adj = [set() for i in range(v + 1)]
	for i in range(v - 1):
		(u1, u2) = In()
		adj[u1].add(u2)
		adj[u2].add(u1)
	return (adj, v)

def bfs(adj, v):
	visited = [False] * (v + 1)
	q = deque()
	while q:
		pass

def sieve():
	li = [True] * 1000001
	(li[0], li[1]) = (False, False)
	for i in range(2, len(li), 1):
		if li[i] == True:
			for j in range(i * i, len(li), i):
				li[j] = False
	prime = []
	for i in range(1000001):
		if li[i] == True:
			prime.append(i)
	return prime

def setBit(n):
	count = 0
	while n != 0:
		n = n & n - 1
		count += 1
	return count

def solve():
	n = II()
	if n % 4 == 0:
		print('YES')
	else:
		print('NO')
t = II()
for i in range(t):
	solve()


import math
import heapq, bisect
import sys
from collections import deque, defaultdict
from fractions import Fraction
mod = 10 ** 9 + 7
mod1 = 998244353
import os
import sys
from io import BytesIO, IOBase
BUFSIZE = 8192

class FastIO(IOBase):
	newlines = 0

	def __init__(self, file):
		self._fd = file.fileno()
		self.buffer = BytesIO()
		self.writable = 'x' in file.mode or 'r' not in file.mode
		self.write = self.buffer.write if self.writable else None

	def read(self):
		while True:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
			if not b:
				break
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines = 0
		return self.buffer.read()

	def readline(self):
		while self.newlines == 0:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
			self.newlines = b.count(b'\n') + (not b)
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines -= 1
		return self.buffer.readline()

	def flush(self):
		if self.writable:
			os.write(self._fd, self.buffer.getvalue())
			(self.buffer.truncate(0), self.buffer.seek(0))

class IOWrapper(IOBase):

	def __init__(self, file):
		self.buffer = FastIO(file)
		self.flush = self.buffer.flush
		self.writable = self.buffer.writable
		self.write = lambda s: self.buffer.write(s.encode('ascii'))
		self.read = lambda : self.buffer.read().decode('ascii')
		self.readline = lambda : self.buffer.readline().decode('ascii')
(sys.stdin, sys.stdout) = (IOWrapper(sys.stdin), IOWrapper(sys.stdout))
input = lambda : sys.stdin.readline().rstrip('\r\n')

class TreeNode:

	def __init__(self, k, v):
		self.key = k
		self.value = v
		self.left = None
		self.right = None
		self.parent = None
		self.height = 1
		self.num_left = 1
		self.num_total = 1

class AvlTree:

	def __init__(self):
		self._tree = None

	def add(self, k, v):
		if not self._tree:
			self._tree = TreeNode(k, v)
			return
		node = self._add(k, v)
		if node:
			self._rebalance(node)

	def _add(self, k, v):
		node = self._tree
		while node:
			if k < node.key:
				if node.left:
					node = node.left
				else:
					node.left = TreeNode(k, v)
					node.left.parent = node
					return node.left
			elif node.key < k:
				if node.right:
					node = node.right
				else:
					node.right = TreeNode(k, v)
					node.right.parent = node
					return node.right
			else:
				node.value = v
				return

	@staticmethod
	def get_height(x):
		return x.height if x else 0

	@staticmethod
	def get_num_total(x):
		return x.num_total if x else 0

	def _rebalance(self, node):
		n = node
		while n:
			lh = self.get_height(n.left)
			rh = self.get_height(n.right)
			n.height = max(lh, rh) + 1
			balance_factor = lh - rh
			n.num_total = 1 + self.get_num_total(n.left) + self.get_num_total(n.right)
			n.num_left = 1 + self.get_num_total(n.left)
			if balance_factor > 1:
				if self.get_height(n.left.left) < self.get_height(n.left.right):
					self._rotate_left(n.left)
				self._rotate_right(n)
			elif balance_factor < -1:
				if self.get_height(n.right.right) < self.get_height(n.right.left):
					self._rotate_right(n.right)
				self._rotate_left(n)
			else:
				n = n.parent

	def _remove_one(self, node):
		replacement = node.left or node.right
		if node.parent:
			if AvlTree._is_left(node):
				node.parent.left = replacement
			else:
				node.parent.right = replacement
			replacement.parent = node.parent
			node.parent = None
		else:
			self._tree = replacement
			replacement.parent = None
		node.left = None
		node.right = None
		node.parent = None
		self._rebalance(replacement)

	def _remove_leaf(self, node):
		if node.parent:
			if AvlTree._is_left(node):
				node.parent.left = None
			else:
				node.parent.right = None
			self._rebalance(node.parent)
		else:
			self._tree = None
		node.parent = None
		node.left = None
		node.right = None

	def remove(self, k):
		node = self._get_node(k)
		if not node:
			return
		if AvlTree._is_leaf(node):
			self._remove_leaf(node)
			return
		if node.left and node.right:
			nxt = AvlTree._get_next(node)
			node.key = nxt.key
			node.value = nxt.value
			if self._is_leaf(nxt):
				self._remove_leaf(nxt)
			else:
				self._remove_one(nxt)
			self._rebalance(node)
		else:
			self._remove_one(node)

	def get(self, k):
		node = self._get_node(k)
		return node.value if node else -1

	def _get_node(self, k):
		if not self._tree:
			return None
		node = self._tree
		while node:
			if k < node.key:
				node = node.left
			elif node.key < k:
				node = node.right
			else:
				return node
		return None

	def get_at(self, pos):
		x = pos + 1
		node = self._tree
		while node:
			if x < node.num_left:
				node = node.left
			elif node.num_left < x:
				x -= node.num_left
				node = node.right
			else:
				return (node.key, node.value)
		raise IndexError('Out of ranges')

	@staticmethod
	def _is_left(node):
		return node.parent.left and node.parent.left == node

	@staticmethod
	def _is_leaf(node):
		return node.left is None and node.right is None

	def _rotate_right(self, node):
		if not node.parent:
			self._tree = node.left
			node.left.parent = None
		elif AvlTree._is_left(node):
			node.parent.left = node.left
			node.left.parent = node.parent
		else:
			node.parent.right = node.left
			node.left.parent = node.parent
		bk = node.left.right
		node.left.right = node
		node.parent = node.left
		node.left = bk
		if bk:
			bk.parent = node
		node.height = max(self.get_height(node.left), self.get_height(node.right)) + 1
		node.num_total = 1 + self.get_num_total(node.left) + self.get_num_total(node.right)
		node.num_left = 1 + self.get_num_total(node.left)

	def _rotate_left(self, node):
		if not node.parent:
			self._tree = node.right
			node.right.parent = None
		elif AvlTree._is_left(node):
			node.parent.left = node.right
			node.right.parent = node.parent
		else:
			node.parent.right = node.right
			node.right.parent = node.parent
		bk = node.right.left
		node.right.left = node
		node.parent = node.right
		node.right = bk
		if bk:
			bk.parent = node
		node.height = max(self.get_height(node.left), self.get_height(node.right)) + 1
		node.num_total = 1 + self.get_num_total(node.left) + self.get_num_total(node.right)
		node.num_left = 1 + self.get_num_total(node.left)

	@staticmethod
	def _get_next(node):
		if not node.right:
			return node.parent
		n = node.right
		while n.left:
			n = n.left
		return n
avl = AvlTree()

class SegmentTree1:

	def __init__(self, data, default='z', func=lambda a, b: min(a, b)):
		self._default = default
		self._func = func
		self._len = len(data)
		self._size = _size = 1 << (self._len - 1).bit_length()
		self.data = [default] * (2 * _size)
		self.data[_size:_size + self._len] = data
		for i in reversed(range(_size)):
			self.data[i] = func(self.data[i + i], self.data[i + i + 1])

	def __delitem__(self, idx):
		self[idx] = self._default

	def __getitem__(self, idx):
		return self.data[idx + self._size]

	def __setitem__(self, idx, value):
		idx += self._size
		self.data[idx] = value
		idx >>= 1
		while idx:
			self.data[idx] = self._func(self.data[2 * idx], self.data[2 * idx + 1])
			idx >>= 1

	def __len__(self):
		return self._len

	def query(self, start, stop):
		if start == stop:
			return self.__getitem__(start)
		stop += 1
		start += self._size
		stop += self._size
		res = self._default
		while start < stop:
			if start & 1:
				res = self._func(res, self.data[start])
				start += 1
			if stop & 1:
				stop -= 1
				res = self._func(res, self.data[stop])
			start >>= 1
			stop >>= 1
		return res

	def __repr__(self):
		return 'SegmentTree({0})'.format(self.data)

class SegmentTree:

	def __init__(self, data, default=0, func=lambda a, b: a * a + b * b):
		self._default = default
		self._func = func
		self._len = len(data)
		self._size = _size = 1 << (self._len - 1).bit_length()
		self.data = [default] * (2 * _size)
		self.data[_size:_size + self._len] = data
		for i in reversed(range(_size)):
			self.data[i] = func(self.data[i + i], self.data[i + i + 1])

	def __delitem__(self, idx):
		self[idx] = self._default

	def __getitem__(self, idx):
		return self.data[idx + self._size]

	def __setitem__(self, idx, value):
		idx += self._size
		self.data[idx] = value
		idx >>= 1
		while idx:
			self.data[idx] = self._func(self.data[2 * idx], self.data[2 * idx + 1])
			idx >>= 1

	def __len__(self):
		return self._len

	def query(self, start, stop):
		if start == stop:
			return self.__getitem__(start)
		stop += 1
		start += self._size
		stop += self._size
		res = self._default
		while start < stop:
			if start & 1:
				res = self._func(res, self.data[start])
				start += 1
			if stop & 1:
				stop -= 1
				res = self._func(res, self.data[stop])
			start >>= 1
			stop >>= 1
		return res

	def __repr__(self):
		return 'SegmentTree({0})'.format(self.data)

class Factorial:

	def __init__(self, MOD):
		self.MOD = MOD
		self.factorials = [1, 1]
		self.invModulos = [0, 1]
		self.invFactorial_ = [1, 1]

	def calc(self, n):
		if n <= -1:
			print('Invalid argument to calculate n!')
			print('n must be non-negative value. But the argument was ' + str(n))
			exit()
		if n < len(self.factorials):
			return self.factorials[n]
		nextArr = [0] * (n + 1 - len(self.factorials))
		initialI = len(self.factorials)
		prev = self.factorials[-1]
		m = self.MOD
		for i in range(initialI, n + 1):
			prev = nextArr[i - initialI] = prev * i % m
		self.factorials += nextArr
		return self.factorials[n]

	def inv(self, n):
		if n <= -1:
			print('Invalid argument to calculate n^(-1)')
			print('n must be non-negative value. But the argument was ' + str(n))
			exit()
		p = self.MOD
		pi = n % p
		if pi < len(self.invModulos):
			return self.invModulos[pi]
		nextArr = [0] * (n + 1 - len(self.invModulos))
		initialI = len(self.invModulos)
		for i in range(initialI, min(p, n + 1)):
			next = -self.invModulos[p % i] * (p // i) % p
			self.invModulos.append(next)
		return self.invModulos[pi]

	def invFactorial(self, n):
		if n <= -1:
			print('Invalid argument to calculate (n^(-1))!')
			print('n must be non-negative value. But the argument was ' + str(n))
			exit()
		if n < len(self.invFactorial_):
			return self.invFactorial_[n]
		self.inv(n)
		nextArr = [0] * (n + 1 - len(self.invFactorial_))
		initialI = len(self.invFactorial_)
		prev = self.invFactorial_[-1]
		p = self.MOD
		for i in range(initialI, n + 1):
			prev = nextArr[i - initialI] = prev * self.invModulos[i % p] % p
		self.invFactorial_ += nextArr
		return self.invFactorial_[n]

class Combination:

	def __init__(self, MOD):
		self.MOD = MOD
		self.factorial = Factorial(MOD)

	def ncr(self, n, k):
		if k < 0 or n < k:
			return 0
		k = min(k, n - k)
		f = self.factorial
		return f.calc(n) * f.invFactorial(max(n - k, k)) * f.invFactorial(min(k, n - k)) % self.MOD

def powm(a, n, m):
	if a == 1 or n == 0:
		return 1
	if n % 2 == 0:
		s = powm(a, n // 2, m)
		return s * s % m
	else:
		return a * powm(a, n - 1, m) % m

def sort_list(list1, list2):
	zipped_pairs = zip(list2, list1)
	z = [x for (_, x) in sorted(zipped_pairs)]
	return z

def product(l):
	por = 1
	for i in range(len(l)):
		por *= l[i]
	return por

def binarySearchCount(arr, n, key):
	left = 0
	right = n - 1
	count = 0
	while left <= right:
		mid = int((right + left) / 2)
		if arr[mid] <= key:
			count = mid + 1
			left = mid + 1
		else:
			right = mid - 1
	return count

def countdig(n):
	c = 0
	while n > 0:
		n //= 10
		c += 1
	return c

def countGreater(arr, n, k):
	l = 0
	r = n - 1
	leftGreater = n
	while l <= r:
		m = int(l + (r - l) / 2)
		if arr[m] >= k:
			leftGreater = m
			r = m - 1
		else:
			l = m + 1
	return n - leftGreater
for i in range(int(input())):
	n = int(input())
	if n % 4 == 0:
		print('YES')
	else:
		print('NO')


def main():
	t = int(input())
	for i in range(t):
		solve()

def solve():
	n = int(input())
	if n % 4 == 0:
		print('YES')
	else:
		print('NO')
main()


import sys
import math
import heapq
import collections

def inputnum():
	return int(input())

def inputnums():
	return map(int, input().split())

def inputlist():
	return list(map(int, input().split()))

def inputstring():
	return [x for x in input()]

def inputmatrixchar(rows):
	arr2d = [[j for j in input().strip()] for i in range(rows)]
	return arr2d

def inputmatrixint(rows):
	arr2d = []
	for _ in range(rows):
		arr2d.append([int(i) for i in input().split()])
	return arr2d
t = int(input())
for q in range(t):
	n = inputnum()
	if n % 4 == 0:
		print('YES')
		continue
	print('NO')


t = int(input())
for i in range(t):
	a = int(input())
	if a % 4 == 0:
		print('Yes')
	else:
		print('NO')


import sys
input = lambda : sys.stdin.readline().strip()
for _ in range(int(input())):
	n = int(input())
	print('YES' if 90 * n % 360 == 0 else 'NO')


def prog():
	for _ in range(int(input())):
		if int(input()) % 4 == 0:
			print('YES')
		else:
			print('NO')
prog()


import math

def BuubleSort(n):
	if n % 4 == 0:
		return 'YES'
	else:
		return 'NO'

def main():
	t = int(input())
	for _ in range(t):
		a = int(input())
		ans = BuubleSort(a)
		print(ans)
main()


t = int(input())
while t:
	n = int(input())
	if int((n - 4) / 4) == (n - 4) / 4:
		print('Yes')
	else:
		print('NO')
	t -= 1


from collections import defaultdict as dd
import math
import sys
import string
input = sys.stdin.readline

def nn():
	return int(input())

def li():
	return list(input())

def mi():
	return map(int, input().split())

def lm():
	return list(map(int, input().split()))
q = nn()
for _ in range(q):
	n = nn()
	if n % 4 == 0:
		print('YES')
	else:
		print('NO')


import math
n = int(input())

def fu(a):
	if a % 4 == 0:
		return 'YES'
	else:
		return 'NO'
for i in range(n):
	a = int(input())
	print(fu(a))


import sys
input = sys.stdin.readline

def solve():
	n = int(input())
	if n % 4 == 0:
		print('YES')
	else:
		print('NO')
test = int(input())
while test != 0:
	solve()
	test -= 1


from __future__ import division, print_function
from sys import stdin, stdout
import bisect
import math
import heapq
i_m = 9223372036854775807

def inin():
	return int(input())

def stin():
	return input()

def spin():
	return map(int, stin().split())

def lin():
	return list(map(int, stin().split()))

def matrix(n):
	return [list(map(int, input().split())) for i in range(n)]

def count2Dmatrix(i, list):
	return sum((c.count(i) for c in list))

def modinv(n, p):
	return pow(n, p - 2, p)

def GCD(x, y):
	x = abs(x)
	y = abs(y)
	if min(x, y) == 0:
		return max(x, y)
	while y:
		(x, y) = (y, x % y)
	return x

def Divisors(n):
	l = []
	for i in range(1, int(math.sqrt(n) + 1)):
		if n % i == 0:
			if n // i == i:
				l.append(i)
			else:
				l.append(i)
				l.append(n // i)
	return l
prime = []

def SieveOfEratosthenes(n):
	global prime
	prime = [True for i in range(n + 1)]
	p = 2
	while p * p <= n:
		if prime[p] == True:
			for i in range(p * p, n + 1, p):
				prime[i] = False
		p += 1
	f = []
	for p in range(2, n):
		if prime[p]:
			f.append(p)
	return f
q = []

def dfs(n, d, v, c):
	global q
	v[n] = 1
	x = d[n]
	q.append(n)
	j = c
	for i in x:
		if i not in v:
			f = dfs(i, d, v, c + 1)
			j = max(j, f)
	return j
for _ in range(inin()):
	n = inin()
	if n % 4 == 0:
		print('Yes')
	else:
		print('No')


import collections
t = int(input())
for _ in range(t):
	n = int(input())
	if n % 4 == 0:
		print('YES')
	else:
		print('NO')


from fractions import Fraction
import sys
import bisect
import heapq
from math import *
from collections import Counter as counter
from itertools import combinations as comb
from itertools import permutations as permutate
from bisect import bisect_left as bl
from bisect import bisect_right as br
from bisect import bisect
import statistics
from statistics import mode
mod = 1000000007

def inp():
	return sys.stdin.readline().strip()

def out(var):
	sys.stdout.write(str(var))

def lis():
	return list(map(int, inp().split()))

def stringlis():
	return list(map(str, inp().split()))

def sep():
	return map(int, inp().split())

def strsep():
	return map(str, inp().split())

def graph(vertex):
	return [[] for i in range(0, vertex + 1)]

def zerolist(n):
	return [0] * n

def nextline():
	out('\n')

def testcase(t):
	for p in range(t):
		solve()

def printlist(a):
	for p in range(0, len(a)):
		out(str(a[p]) + ' ')

def lcm(a, b):
	return a * b // gcd(a, b)

def power(a, b):
	ans = 1
	while b > 0:
		if b % 2 == 1:
			ans *= a
		a *= a
		b //= 2
	return ans

def most_frequent(List):
	occurence_count = Counter(List)
	return occurence_count.most_common(1)[0][0]

def most_common(List):
	return mode(List)

def createMatrix(rowCount, colCount, dataList):
	mat = []
	for i in range(rowCount):
		rowList = []
		for j in range(colCount):
			if dataList[j] not in mat:
				rowList.append(dataList[j])
		mat.append(rowList)
	return mat

def isprime(n):
	if n <= 1:
		return False
	if n <= 3:
		return True
	if n % 2 == 0 or n % 3 == 0:
		return False
	i = 5
	while i * i <= n:
		if n % i == 0 or n % (i + 2) == 0:
			return False
		i = i + 6
	return True
import collections

def minimalFilps1(bits):
	n = len(bits)
	flipsFromLeft = [0 for i in range(n)]
	flipsFromRight = [0 for i in range(n)]
	flips = 0
	for i in range(0, n, 1):
		if bits[i] == '1':
			flips = flips + 1
		flipsFromLeft[i] = flips
	flips = 0
	i = n - 1
	while i >= 0:
		if bits[i] == '0':
			flips = flips + 1
		i = i - 1
		flipsFromRight[i] = flips
	minFlips1 = sys.maxsize
	for i in range(1, n, 1):
		if flipsFromLeft[i - 1] + flipsFromRight[i] < minFlips1:
			minFlips1 = flipsFromLeft[i - 1] + flipsFromRight[i]
	return minFlips1

def minimalFilps(bits):
	n = len(bits)
	flipsFromLeft = [0 for i in range(n)]
	flipsFromRight = [0 for i in range(n)]
	flips = 0
	for i in range(0, n, 1):
		if bits[i] == '0':
			flips = flips + 1
		flipsFromLeft[i] = flips
	flips = 0
	i = n - 1
	while i >= 0:
		if bits[i] == '1':
			flips = flips + 1
		i = i - 1
		flipsFromRight[i] = flips
	minFlips = sys.maxsize
	for i in range(1, n, 1):
		if flipsFromLeft[i - 1] + flipsFromRight[i] < minFlips:
			minFlips = flipsFromLeft[i - 1] + flipsFromRight[i]
	return minFlips

def oddn(n):
	for i in range(2, n + 1):
		if i % 2 != 0 and n % i == 0:
			return i
	return 3
for i in range(int(input())):
	n = int(input())
	if n % 4 == 0:
		print('YES')
	else:
		print('NO')


res = ''
for _ in range(int(input())):
	n = int(input())
	res += ('NO\n', 'YES\n')[n % 4 == 0]
print(res)


case = int(input())
for i in range(0, case):
	n = int(input())
	if not n % 4:
		answer = 'YES'
	else:
		answer = 'NO'
	print(answer)


ans = []
for t in range(int(input())):
	if int(input()) % 4:
		ans += ['NO']
	else:
		ans += ['YES']
print(*ans, sep='\n')


for _ in ' ' * int(input()):
	a = int(input())
	if a % 4:
		print('NO')
	else:
		print('YES')


from sys import stdin

def main():
	input = lambda : stdin.readline()[:-1]
	T = int(input())
	for _ in [0] * T:
		N = int(input())
		if N % 4:
			print('NO')
		else:
			print('YES')
main()


import sys
input = sys.stdin.readline
read = lambda : map(int, input().split())
read_float = lambda : map(float, input().split())

def ceil(x):
	if x != int(x):
		x = int(x) + 1
	return x

def factorial(x, m):
	val = 1
	while x > 0:
		val = val * x % m
		x -= 1
	return val

def fact(x):
	val = 1
	while x > 0:
		val *= x
		x -= 1
	return val

def swaparr(arr, a, b):
	temp = arr[a]
	arr[a] = arr[b]
	arr[b] = temp

def gcd(a, b):
	if b == 0:
		return a
	return gcd(b, a % b)

def lcm(a, b):
	return a * b // math.gcd(a, b)

def nCr(n, k):
	if k > n:
		return 0
	if k > n - k:
		k = n - k
	res = 1
	for i in range(k):
		res = res * (n - i)
		res = res / (i + 1)
	return int(res)

def primefs(n):
	primes = {}
	while n % 2 == 0 and n > 0:
		primes[2] = primes.get(2, 0) + 1
		n = n // 2
	for i in range(3, int(n ** 0.5) + 2, 2):
		while n % i == 0 and n > 0:
			primes[i] = primes.get(i, 0) + 1
			n = n // i
	if n > 2:
		primes[n] = primes.get(n, 0) + 1
	return primes

def power(x, y, p):
	res = 1
	x = x % p
	if x == 0:
		return 0
	while y > 0:
		if y & 1 == 1:
			res = res * x % p
		y = y >> 1
		x = x * x % p
	return res

def swap(a, b):
	temp = a
	a = b
	b = temp
	return (a, b)

def find(x, link):
	p = x
	while p != link[p]:
		p = link[p]
	while x != p:
		nex = link[x]
		link[x] = p
		x = nex
	return p

def union(x, y, link, size):
	x = find(x, link)
	y = find(y, link)
	if size[x] < size[y]:
		(x, y) = swap(x, y)
	if x != y:
		size[x] += size[y]
		link[y] = x

def sieve(n):
	prime = [True for i in range(n + 1)]
	(prime[0], prime[1]) = (False, False)
	p = 2
	while p * p <= n:
		if prime[p] == True:
			for i in range(p * p, n + 1, p):
				prime[i] = False
		p += 1
	return prime

def phi(n):
	result = n
	p = 2
	while p * p <= n:
		if n % p == 0:
			while n % p == 0:
				n = n // p
			result = result * (1.0 - 1.0 / float(p))
		p = p + 1
	if n > 1:
		result = result * (1.0 - 1.0 / float(n))
	return int(result)

def is_prime(n):
	if n == 0:
		return False
	if n == 1:
		return True
	for i in range(2, int(n ** (1 / 2)) + 1):
		if not n % i:
			return False
	return True
MAXN = int(100000.0 + 5)

def spf_sieve():
	spf[1] = 1
	for i in range(2, MAXN):
		spf[i] = i
	for i in range(4, MAXN, 2):
		spf[i] = 2
	for i in range(3, ceil(MAXN ** 0.5), 2):
		if spf[i] == i:
			for j in range(i * i, MAXN, i):
				if spf[j] == j:
					spf[j] = i
spf = [0 for i in range(MAXN)]

def factoriazation(x):
	res = []
	for i in range(2, int(x ** 0.5) + 1):
		while x % i == 0:
			res.append(i)
			x //= i
	if x != 1:
		res.append(x)
	return res

def factors(n):
	res = []
	for i in range(1, int(n ** 0.5) + 1):
		if n % i == 0:
			res.append(i)
			res.append(n // i)
	return list(set(res))

def int_array():
	return list(map(int, input().strip().split()))

def float_array():
	return list(map(float, input().strip().split()))

def str_array():
	return input().strip().split()

def binary_search(low, high, w, h, n):
	while low < high:
		mid = low + (high - low) // 2
		if check(mid, w, h, n):
			low = mid + 1
		else:
			high = mid
	return low

def check(div, n):
	if div == 0:
		return True
	return n % div == 0
MOD = int(1000000000.0) + 7
CMOD = 998244353
INF = float('inf')
NINF = -float('inf')
from itertools import permutations
import math
import bisect as bis
import random
import sys

def solve():
	n = int(input())
	print({True: 'YES', False: 'NO'}[n % 4 == 0])
for _ in range(int(input())):
	solve()


production = True
import sys, math, collections

def input(input_format=0, multi=0):
	if multi > 0:
		return [input(input_format) for i in range(multi)]
	else:
		next_line = sys.stdin.readline()[:-1]
		if input_format >= 10:
			use_list = False
			input_format = int(str(input_format)[-1])
		else:
			use_list = True
		if input_format == 0:
			formatted_input = [next_line]
		elif input_format == 1:
			formatted_input = list(map(int, next_line.split()))
		elif input_format == 2:
			formatted_input = list(map(float, next_line.split()))
		elif input_format == 3:
			formatted_input = list(next_line)
		elif input_format == 4:
			formatted_input = (lambda x: [x[0], list(map(int, x[1:]))])(next_line.split())
		elif input_format == 5:
			formatted_input = (lambda x: [x[0], list(map(float, x[1:]))])(next_line.split())
		elif input_format == 6:
			formatted_input = next_line.split()
		else:
			formatted_input = [next_line]
		return formatted_input if use_list else formatted_input[0]

def out(output_line, output_format=0, newline=True):
	formatted_output = ''
	if output_format == 0:
		formatted_output = str(output_line)
	elif output_format == 1:
		formatted_output = ' '.join(map(str, output_line))
	elif output_format == 2:
		formatted_output = '\n'.join(map(str, output_line))
	print(formatted_output, end='\n' if newline else '')

def log(*args):
	if not production:
		print('$$$', end='')
		print(*args)
enum = enumerate

def solve():
	n = input(11)
	out('YES' if n % 4 == 0 else 'NO')
	return
for i in range(input(11)):
	solve()


from sys import stdin, stdout
import math
input = stdin.readline

def print(x='', end='\n'):
	stdout.write(str(x) + end)

def solve():
	n = int(input())
	if n % 4:
		print('NO')
	else:
		print('YES')
tt = 1
tt = int(input())
for __ in range(tt):
	solve()


t = int(input())
while t != 0:
	t -= 1
	n = int(input())
	p = (n - 2) * 180 / n
	if n % 2 != 0:
		print('NO')
	else:
		k = (n - 2) // 2
		if k % 2 != 0:
			print('YES')
		else:
			print('NO')


import sys

def scanint():
	return int(sys.stdin.readline().rstrip())

def scanints():
	return map(int, sys.stdin.readline().rstrip().split())

def scanarr():
	return list(map(int, sys.stdin.readline().rstrip().split()))
from queue import PriorityQueue
import heapq
import math
t = scanint()
for _ in range(t):
	ni = scanint()
	if 90 * ni % (180 * ni - 180 * (ni - 2)) == 0:
		print('YES')
	else:
		print('NO')


x = int(input(''))
y = 1
while y <= x:
	y = y + 1
	i = int(input(''))
	if i % 4 == 0:
		print('YES')
	else:
		print('NO')


import sys
t = int(sys.stdin.readline().rstrip())
while t > 0:
	inp = int(sys.stdin.readline().strip())
	if inp % 4 == 0:
		print('YES')
	else:
		print('NO')
	t = t - 1


test = int(input())
for i in range(test):
	m = int(input())
	if m % 4 == 0:
		print('YES')
	else:
		print('NO')


import math as ma
t = int(input())
for _ in range(t):
	n = int(input())
	if n % 4 == 0:
		print('YES')
	else:
		print('NO')


from sys import stdin
inp = lambda : stdin.readline().strip()
t = int(inp())
for _ in range(t):
	x = int(inp())
	if x % 4 == 0:
		print('YES')
	else:
		print('NO')


for _ in range(int(input())):
	n = int(input())
	if n % 2 == 1:
		print('NO')
		continue
	if n // 2 % 2 == 0:
		print('YES')
	else:
		print('NO')


import sys
input = sys.stdin.readline
f = lambda : list(map(int, input().split()))
for _ in range(int(input())):
	n = int(input())
	print('NO' if n % 4 else 'YES')


import math
import sys
import re
n = int(input())
for x in range(n):
	a = int(input())
	if a % 4 == 0:
		print('YES')
	else:
		print('NO')


def read_int():
	return int(input())

def read_ints():
	return map(int, input().split(' '))
t = read_int()
for case_num in range(t):
	n = read_int()
	print('YES' if n % 4 == 0 else 'NO')


input_length = int(input())
while input_length != 0:
	num_sides = int(input())
	if num_sides % 4 == 0:
		print('YES')
	else:
		print('No')
	input_length -= 1


a = input()
for x in range(int(a)):
	b = input()
	ans = 0
	if int(b) % 4 == 0:
		print('YES')
	else:
		print('NO')


n = int(input())
cases = [int(input()) for _ in range(n)]
for case in cases:
	if case % 4 == 0:
		print('YES')
	else:
		print('NO')


def main():
	for i in range(int(input())):
		if int(input()) % 4 == 0:
			print('YES')
		else:
			print('NO')
main()


def check(b):
	if b % 4 == 0:
		return 'YES'
	else:
		return 'NO'
a = int(input())
c = []
for i in range(0, a):
	b = int(input())
	c.append(check(b))
for i in range(0, len(c)):
	print(c[i])


t = int(input())
L = []
for i in range(t):
	L.append(int(input()))
for i in range(t):
	if L[i] % 4 == 0:
		print('YES')
	else:
		print('NO')


from sys import stdin, stdout
from math import gcd, ceil, sqrt
ii1 = lambda : int(stdin.readline().strip())
is1 = lambda : stdin.readline().strip()
iia = lambda : list(map(int, stdin.readline().strip().split()))
isa = lambda : stdin.readline().strip().split()
mod = 1000000007
tc = ii1()
for _ in range(tc):
	n = ii1()
	if n % 4 == 0:
		print('YES')
	else:
		print('NO')


def fashion():
	n = int(input())
	if (n - 4) % 4 == 0:
		print('Yes')
	else:
		print('No')

def ono():
	t = int(input())
	for i in range(t):
		fashion()
ono()


n = int(input())
liste = []
for i in range(n):
	side = int(input())
	liste.append(side)
for side in liste:
	if side % 4 == 0:
		print('YES')
	else:
		print('NO')


ans = []
for _ in range(int(input())):
	if int(input()) % 4:
		ans += ['NO']
	else:
		ans += ['YES']
print('\n'.join(ans))


from sys import stdin, stdout
import sys
INF = 100000000000.0
import math

def get_int():
	return int(stdin.readline().strip())

def get_ints():
	return map(int, stdin.readline().strip().split())

def get_array():
	return list(map(int, stdin.readline().strip().split()))

def get_string():
	return stdin.readline().strip()

def op(c):
	return stdout.write(c)
from collections import defaultdict
for _ in range(int(stdin.readline())):
	n = get_int()
	if n % 4 == 0:
		print('YES')
	else:
		print('NO')


def solve():
	n = int(input())
	if n % 4 == 0:
		print('yes')
	else:
		print('no')
t = int(input())
for _ in range(t):
	solve()


s = int(input())
count = 0
ans = []
while count < s:
	t = int(input())
	if t % 2 != 0:
		ans.append('NO')
	else:
		t -= 2
		p = t // 2
		if p % 2 != 0:
			ans.append('YES')
		else:
			ans.append('NO')
	count += 1
for y in ans:
	print(y)


try:
	t = int(input())
	while t:
		n = int(input())
		if (n - 2) // 180 // n <= 180 and n % 4 == 0:
			print('YES')
		else:
			print('NO')
except:
	pass


test = int(input())
for t in range(test):
	mod = int(input()) % 4
	if mod == 0:
		print('YES')
	else:
		print('NO')


import sys
int1 = lambda x: int(x) - 1
p2D = lambda x: print(*x, sep='\n')

def II():
	return int(sys.stdin.readline())

def MI():
	return map(int, sys.stdin.readline().split())

def LI():
	return list(map(int, sys.stdin.readline().split()))

def LLI(rows_number):
	return [LI() for _ in range(rows_number)]

def SI():
	return sys.stdin.readline()[:-1]

def main():
	for _ in range(II()):
		n = II()
		if n % 4:
			print('NO')
		else:
			print('YES')
main()


from sys import stdin
input = stdin.buffer.readline
for _ in range(int(input())):
	n = int(input())
	if n & 3:
		print('NO')
	else:
		print('YES')


T = int(input())
for t in range(T):
	n = int(input())
	ats = 'NO'
	if n % 4 == 0:
		ats = 'YES'
	print(ats)


import atexit
import io
import sys
import math
from collections import defaultdict, Counter
t = int(input())
for i in range(t):
	n = int(input())
	if n % 4 == 0:
		print('YES')
	else:
		print('NO')


import math
T = int(input())
for _ in range(T):
	n = int(input())
	print('YES' if n % 4 == 0 else 'NO')


from collections import defaultdict, deque
from heapq import heappush, heappop
from bisect import bisect_left, bisect_right
import sys, itertools, math
sys.setrecursionlimit(10 ** 5)
input = sys.stdin.readline
sqrt = math.sqrt

def LI():
	return list(map(int, input().split()))

def LF():
	return list(map(float, input().split()))

def LI_():
	return list(map(lambda x: int(x) - 1, input().split()))

def II():
	return int(input())

def IF():
	return float(input())

def S():
	return input().rstrip()

def LS():
	return S().split()

def IR(n):
	res = [None] * n
	for i in range(n):
		res[i] = II()
	return res

def LIR(n):
	res = [None] * n
	for i in range(n):
		res[i] = LI()
	return res

def FR(n):
	res = [None] * n
	for i in range(n):
		res[i] = IF()
	return res

def LIR(n):
	res = [None] * n
	for i in range(n):
		res[i] = IF()
	return res

def LIR_(n):
	res = [None] * n
	for i in range(n):
		res[i] = LI_()
	return res

def SR(n):
	res = [None] * n
	for i in range(n):
		res[i] = S()
	return res

def LSR(n):
	res = [None] * n
	for i in range(n):
		res[i] = LS()
	return res
mod = 1000000007
inf = float('INF')

def solve():
	t = II()
	for _ in range(t):
		n = II()
		if n % 4 != 0:
			print('NO')
		else:
			print('YES')
	return
solve()


n = int(input())
ar = list()
for i in range(n):
	ar.append(int(input()))
for i in ar:
	k = (i - 2) / 2
	if k == int(k) and int(k) % 2 == 1:
		print('YES')
	else:
		print('NO')


for _ in range(int(input())):
	print(['YES', 'NO'][min(int(input()) & 3, 1)])


from __future__ import division, print_function
from fractions import Fraction
import sys
import os
from io import BytesIO, IOBase
from itertools import *
import bisect
from heapq import *
from math import *
from copy import *
from collections import deque
from collections import Counter as counter
from itertools import combinations as comb
from itertools import permutations as permutate
from bisect import bisect_left as bl
from bisect import bisect_right as br
from bisect import bisect
BUFSIZE = 8192

class FastIO(IOBase):
	newlines = 0

	def __init__(self, file):
		self._fd = file.fileno()
		self.buffer = BytesIO()
		self.writable = 'x' in file.mode or 'r' not in file.mode
		self.write = self.buffer.write if self.writable else None

	def read(self):
		while True:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
			if not b:
				break
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines = 0
		return self.buffer.read()

	def readline(self):
		while self.newlines == 0:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
			self.newlines = b.count(b'\n') + (not b)
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines -= 1
		return self.buffer.readline()

	def flush(self):
		if self.writable:
			os.write(self._fd, self.buffer.getvalue())
			(self.buffer.truncate(0), self.buffer.seek(0))

class IOWrapper(IOBase):

	def __init__(self, file):
		self.buffer = FastIO(file)
		self.flush = self.buffer.flush
		self.writable = self.buffer.writable
		self.write = lambda s: self.buffer.write(s.encode('ascii'))
		self.read = lambda : self.buffer.read().decode('ascii')
		self.readline = lambda : self.buffer.readline().decode('ascii')

def print(*args, **kwargs):
	(sep, file) = (kwargs.pop('sep', ' '), kwargs.pop('file', sys.stdout))
	at_start = True
	for x in args:
		if not at_start:
			file.write(sep)
		file.write(str(x))
		at_start = False
	file.write(kwargs.pop('end', '\n'))
	if kwargs.pop('flush', False):
		file.flush()
if sys.version_info[0] < 3:
	(sys.stdin, sys.stdout) = (FastIO(sys.stdin), FastIO(sys.stdout))
else:
	(sys.stdin, sys.stdout) = (IOWrapper(sys.stdin), IOWrapper(sys.stdout))
from types import GeneratorType

def iterative(f, stack=[]):

	def wrapped_func(*args, **kwargs):
		if stack:
			return f(*args, **kwargs)
		to = f(*args, **kwargs)
		while True:
			if type(to) is GeneratorType:
				stack.append(to)
				to = next(to)
				continue
			stack.pop()
			if not stack:
				break
			to = stack[-1].send(to)
		return to
	return wrapped_func
mod = 1000000007

def inp():
	return sys.stdin.readline().rstrip('\r\n')

def out(var):
	sys.stdout.write(str(var))

def lis():
	return list(map(int, inp().split()))

def stringlis():
	return list(map(str, inp().split()))

def sep():
	return map(int, inp().split())

def strsep():
	return map(str, inp().split())

def zerolist(n):
	return [0] * n

def nextline():
	out('\n')

def testcase(t):
	for p in range(t):
		solve()

def printlist(a):
	for p in range(0, len(a)):
		out(str(a[p]) + ' ')

def solve():
	n = int(inp())
	if n % 4 == 0:
		print('YES')
	else:
		print('NO')
testcase(int(inp()))


try:
	t = int(input())
	while t:
		t -= 1
		n = int(input())
		if n % 4 != 0:
			print('NO')
		else:
			print('YES')
except:
	pass


class Polygon(object):

	def is_nice(self):
		self.n = int(input())
		for i in range(self.n):
			self.m = int(input())
			if self.m % 4 == 0:
				print('YES')
			else:
				print('NO')
cc = Polygon()
cc.is_nice()


from collections import *
import sys
input = sys.stdin.readline
from math import *
t = int(input())
while t:
	t -= 1
	n = int(input())
	s = 'NO'
	if n % 2 == 0 and n // 2 % 2 == 0:
		s = 'YES'
	print(s)


import sys
import math

def II():
	return int(sys.stdin.readline())

def LI():
	return list(map(int, sys.stdin.readline().split()))

def MI():
	return map(int, sys.stdin.readline().split())

def SI():
	return sys.stdin.readline().strip()
t = II()
for q in range(t):
	n = II()
	if n % 4 == 0:
		print('Yes')
	else:
		print('No')


import sys
read = lambda : sys.stdin.readline()
T = int(read())
for t in range(T):
	n = int(read())
	if n % 4 == 0:
		print('YES')
	else:
		print('NO')


t = int(input())
for s in range(t):
	n = int(input())
	if n % 4 == 0 and n > 0:
		print('YES')
	else:
		print('NO')


n = int(input())
L = []
for i in range(n):
	i = int(input())
	if i % 4 == 0:
		L.append('YES')
	else:
		L.append('NO')
	i = 0
for el in L:
	print(el)


rr = lambda : input()
rri = lambda : int(input())
rrm = lambda : list(map(int, input().split()))
INF = float('inf')

def solve(n):
	if n % 4 == 0:
		return 'YES'
	return 'NO'
t = rri()
for _ in range(t):
	n = rri()
	print(solve(n))


def solve():
	n = int(input())
	return 'YES' if n % 4 == 0 else 'NO'
t = int(input())
ans = []
while t:
	ans.append(str(solve()))
	t -= 1
print('\n'.join(ans))


import math, sys, bisect
from collections import defaultdict, Counter, deque
from itertools import groupby, accumulate
input = iter(sys.stdin.buffer.read().decode().splitlines()).__next__
ilele = lambda : map(int, input().split())
alele = lambda : list(map(int, input().split()))

def Y(c):
	print(['NO', 'YES'][c])

def y(c):
	print(['no', 'yes'][c])

def Yy(c):
	print(['No', 'Yes'][c])
for _ in range(int(input())):
	Y(int(input()) % 4 == 0)


n1 = int(input())
for x in range(n1):
	n2 = int(input())
	if n2 % 4 == 0:
		print('YES')
	else:
		print('NO')


def solve():
	side = int(input())
	if side % 4 == 0:
		return 'YES'
	return 'NO'
for _ in range(int(input())):
	print(solve())


for _ in range(int(input())):
	n = int(input())
	if n & 1:
		print('No')
	else:
		s = (n - 2) // 2
		if s & 1:
			print('Yes')
		else:
			print('No')


test = int(input())
for i in range(test):
	n = int(input())
	if n == 3:
		print('NO')
	elif (n - 2) % 2:
		print('NO')
	elif (n - 2) // 2 % 2:
		print('YES')
	else:
		print('NO')


import sys

def second(ele):
	return ele[1]
for _ in range(int(input())):
	n = int(input())
	if n % 4 == 0:
		print('YES')
	else:
		print('NO')


test_cases = int(input())
for t in range(test_cases):
	size = int(input())
	if size % 4 == 0:
		print('YES')
	else:
		print('NO')


T = int(input().rstrip())
for tt in range(T):
	N = int(input().rstrip())
	val = 0.25 * N
	if val.is_integer():
		print('YES')
	else:
		print('NO')


cases = int(input())
for _ in range(cases):
	shape = int(input())
	if shape % 2 == 0:
		print('NO' if (shape - 2) % 4 == 0 else 'YES')
	else:
		print('NO')


import sys
import math
import itertools
import functools
import collections
import operator
import fileinput
import copy
ORDA = 97

def ii():
	return int(input())

def mi():
	return map(int, input().split())

def li():
	return [int(i) for i in input().split()]

def lcm(a, b):
	return abs(a * b) // math.gcd(a, b)

def revn(n):
	return str(n)[::-1]

def dd():
	return collections.defaultdict(int)

def ddl():
	return collections.defaultdict(list)

def sieve(n):
	if n < 2:
		return list()
	prime = [True for _ in range(n + 1)]
	p = 3
	while p * p <= n:
		if prime[p]:
			for i in range(p * 2, n + 1, p):
				prime[i] = False
		p += 2
	r = [2]
	for p in range(3, n + 1, 2):
		if prime[p]:
			r.append(p)
	return r

def divs(n, start=1):
	r = []
	for i in range(start, int(math.sqrt(n) + 1)):
		if n % i == 0:
			if n / i == i:
				r.append(i)
			else:
				r.extend([i, n // i])
	return r

def divn(n, primes):
	divs_number = 1
	for i in primes:
		if n == 1:
			return divs_number
		t = 1
		while n % i == 0:
			t += 1
			n //= i
		divs_number *= t

def prime(n):
	if n == 2:
		return True
	if n % 2 == 0 or n <= 1:
		return False
	sqr = int(math.sqrt(n)) + 1
	for d in range(3, sqr, 2):
		if n % d == 0:
			return False
	return True

def convn(number, base):
	newnumber = 0
	while number > 0:
		newnumber += number % base
		number //= base
	return newnumber

def cdiv(n, k):
	return n // k + (n % k != 0)

def ispal(s):
	for i in range(len(s) // 2 + 1):
		if s[i] != s[-i - 1]:
			return False
	return True
for _ in range(ii()):
	if ii() % 4:
		print('NO')
	else:
		print('YES')


num = int(input())
lis = []
for i in range(num):
	n = int(input())
	lis.append(n)
for j in lis:
	if j % 4 == 0:
		print('YES')
	else:
		print('NO')


import sys
I = sys.stdin.readline
ans = ''
for _ in range(int(I())):
	n = int(I())
	if n % 4 == 0:
		ans += 'YES\n'
	else:
		ans += 'NO\n'
print(ans)


n = int(input())
while n:
	s = int(input())
	flag = True
	if s <= 3 or s % 4 != 0:
		flag = False
	print('YES') if flag else print('NO')
	n -= 1


import math
from decimal import *
getcontext().prec = 30
t = int(input())
while t:
	t -= 1
	n = int(input())
	if n % 4:
		print('NO')
	else:
		print('YES')


import sys
from collections import defaultdict, deque
import math
from bisect import bisect_left, bisect_right
input = sys.stdin.readline
getS = lambda : input().strip()
getN = lambda : int(input())
getList = lambda : list(map(int, input().split()))
getZList = lambda : [int(x) - 1 for x in input().split()]
INF = 10 ** 20
MOD = 10 ** 9 + 7
divide = lambda x: pow(x, MOD - 2, MOD)

def solve():
	n = getN()
	if n % 4 == 0:
		print('YES')
	else:
		print('NO')

def main():
	n = getN()
	for _ in range(n):
		solve()
main()


import sys
input = sys.stdin.readline
output = sys.stdout.write

def main():
	tests = int(input().rstrip())
	for i in range(tests):
		num = int(input().rstrip())
		if num % 4 == 0:
			output('YES')
		else:
			output('NO')
		output('\n')
main()


from fractions import Fraction
import bisect
import os
import io
from collections import Counter
import bisect
from collections import defaultdict
import math
import random
import heapq as hq
from math import sqrt
import sys
from functools import reduce, cmp_to_key
from collections import deque
import threading
from itertools import combinations
from io import BytesIO, IOBase
from itertools import accumulate
from queue import Queue

def input():
	return sys.stdin.readline().strip()

def iinput():
	return int(input())

def tinput():
	return input().split()

def rinput():
	return map(int, tinput())

def rlinput():
	return list(rinput())
mod = int(1000000000.0) + 7

def factors(n):
	return set(reduce(list.__add__, ([i, n // i] for i in range(1, int(n ** 0.5) + 1) if n % i == 0)))
t = 1
t = iinput()
for _ in range(t):
	print('YES' if iinput() % 4 == 0 else 'NO')


test = int(input())
for _ in range(test):
	n = int(input())
	if not n % 4:
		print('YES')
	else:
		print('NO')


from sys import stdin, stdout
from itertools import combinations
from collections import defaultdict, Counter
import math

def listIn():
	return list(map(int, stdin.readline().strip().split()))

def stringListIn():
	return [x for x in stdin.readline().split()]

def intIn():
	return int(stdin.readline())

def stringIn():
	return stdin.readline().strip()
t = intIn()
while t > 0:
	t -= 1
	n = intIn()
	if n % 4 == 0:
		print('YES')
	else:
		print('NO')


import math
t = eval(input())
while t != 0:
	n = eval(input())
	if n % 4 == 0:
		print('YES')
	else:
		print('NO')
	t = t - 1


import sys
import math
from decimal import *

def I():
	return int(sys.stdin.readline())

def IL():
	return list(map(int, sys.stdin.readline().strip().split()))

def ILS():
	return list(map(str, sys.stdin.readline().strip().split()))

def solve():
	tt = I()
	for ii in range(tt):
		n = I()
		if n % 4 == 0:
			print('YES')
		else:
			print('NO')
solve()


num = int(input())
i = int(0)
N = list()
while i < num:
	a = int()
	a = input()
	N.append(a)
	i = i + 1
for n in N:
	b = int(n)
	if (b - 4) % 4 == 0:
		print('YES')
	else:
		print('NO')


from sys import stdin
input = lambda : stdin.readline().strip()
char = [chr(i) for i in range(97, 123)]
CHAR = [chr(i) for i in range(65, 91)]
mp = lambda : list(map(int, input().split()))
INT = lambda : int(input())
rn = lambda : range(INT())
from math import ceil, sqrt, factorial, gcd
for _ in rn():
	n = INT()
	if n % 4 == 0:
		print('YES')
	else:
		print('NO')


import sys
import heapq

def main():
	t = int(input())
	for _ in range(t):
		n = int(input())
		if n % 4:
			print('NO')
		else:
			print('YES')
	return
main()


from sys import *
t = int(stdin.readline())
while t > 0:
	t -= 1
	n = int(stdin.readline())
	if n % 4 == 0:
		print('YES')
	else:
		print('NO')


r = []
for _ in range(int(input())):
	p = int(input())
	r.append('YES' if p / 4 == p // 4 else 'NO')
print('\n'.join(r))


from sys import stdin, stdout
n = int(stdin.readline())
for i in range(n):
	ans = 'YES'
	a = int(stdin.readline())
	if a % 4 != 0:
		ans = 'NO'
	stdout.write(ans + '\n')


import os
import gc
import sys
from io import BytesIO, IOBase
from collections import Counter
from collections import deque
import heapq
import math
import statistics

def sin():
	return input()

def ain():
	return list(map(int, sin().split()))

def sain():
	return input().split()

def iin():
	return int(sin())
MAX = float('inf')
MIN = float('-inf')

def readTree(n, m):
	adj = [deque([]) for _ in range(n + 1)]
	for _ in range(m):
		(u, v) = ain()
		adj[u].append(v)
		adj[v].append(u)
	return adj

def solve():
	pass

def main():
	for _ in range(iin()):
		n = iin()
		if n % 4 == 0:
			print('YES')
		else:
			print('NO')
BUFSIZE = 8192

class FastIO(IOBase):
	newlines = 0

	def __init__(self, file):
		self._fd = file.fileno()
		self.buffer = BytesIO()
		self.writable = 'x' in file.mode or 'r' not in file.mode
		self.write = self.buffer.write if self.writable else None

	def read(self):
		while True:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
			if not b:
				break
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines = 0
		return self.buffer.read()

	def readline(self):
		while self.newlines == 0:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
			self.newlines = b.count(b'\n') + (not b)
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines -= 1
		return self.buffer.readline()

	def flush(self):
		if self.writable:
			os.write(self._fd, self.buffer.getvalue())
			(self.buffer.truncate(0), self.buffer.seek(0))

class IOWrapper(IOBase):

	def __init__(self, file):
		self.buffer = FastIO(file)
		self.flush = self.buffer.flush
		self.writable = self.buffer.writable
		self.write = lambda s: self.buffer.write(s.encode('ascii'))
		self.read = lambda : self.buffer.read().decode('ascii')
		self.readline = lambda : self.buffer.readline().decode('ascii')
(sys.stdin, sys.stdout) = (IOWrapper(sys.stdin), IOWrapper(sys.stdout))
input = lambda : sys.stdin.readline().rstrip('\r\n')
main()


import math

def gcd(a, b):
	if b == 0:
		return a
	return gcd(b, a % b)

def lcm(a, b):
	return a * b / gcd(a, b)

def bs(arr, l, r, x):
	while l <= r:
		mid = l + (r - l) // 2
		if arr[mid] == x:
			return arr[mid]
		elif arr[mid] < x:
			l = mid + 1
		else:
			r = mid - 1
	return -1

def swap(list, pos1, pos2):
	(list[pos1], list[pos2]) = (list[pos2], list[pos1])
	return list
t = int(input())
for _ in range(t):
	n = int(input())
	if n % 4 == 0:
		print('YES')
	else:
		print('NO')


t = int(input())
for i in range(t):
	n = int(input())
	if n % 2 != 0:
		print('NO')
	elif n % 4 == 0:
		print('YES')
	else:
		print('NO')


import math
t = int(input())
for _ in range(t):
	n = int(input())
	x = 360 / n
	if n % 4 == 0:
		print('YES')
	else:
		print('NO')


x = int(input())
result = []
for i in range(x):
	result.append(int(input()))
for i in result:
	if i == 4:
		print('YES')
	elif i % 4 == 0:
		print('YES')
	elif (i - 4) % 4 == 0:
		print('YES')
	else:
		print('NO')


def isPolygonBeautiful(polygons):
	for polygon in polygons:
		if polygon % 4 == 0:
			print('YES')
		else:
			print('NO')
t = int(input())
polygons = []
for _ in range(t):
	polygons.append(int(input()))
isPolygonBeautiful(polygons)


Test = int(input())
while Test > 0:
	n = int(input())
	if 90 * n % 360 == 0:
		print('YES')
	else:
		print('NO')
	Test -= 1


TC = int(input())
for tc in range(TC):
	N = int(input())
	result = N % 4 == 0
	if result:
		print('YES')
	else:
		print('NO')


t = int(input())
a = []
for i in range(t):
	b = int(input())
	a.append(b)
for i in range(len(a)):
	if a[i] % 4 == 0:
		print('YES')
	else:
		print('NO')


numberTestCases = int(input())
for test in range(numberTestCases):
	x = int(input())
	if x % 4 == 0:
		print('YES')
	else:
		print('NO')


t = int(input())
for _ in range(t):
	n = int(input())
	angle = float(360 / n)
	a = float(0)
	f = False
	if n % 4 == 0:
		f = True
	if f == True:
		print('YES')
	else:
		print('NO')


import logging, sys
logging.basicConfig(level=logging.INFO)

def main():
	test = int(sys.stdin.readline())
	while test > 0:
		test -= 1
		n = int(sys.stdin.readline())
		if n % 4 == 0:
			print('YES')
		else:
			print('NO')
try:
	sys.stdin = open('input.txt', 'r')
	sys.stdout = open('output.txt', 'w')
except:
	pass
main()


o = int(input())
for _ in range(o):
	n = int(input())
	if n % 2 == 1:
		print('NO')
	elif n % 4 == 0:
		print('YES')
	else:
		print('NO')


num = int(input())
lst = []
for i in range(num):
	lst.append(int(input()))
for i in lst:
	if i > 3 and (not bool(i % 4)):
		print('YES')
	else:
		print('NO')


import sys
import math
import collections
import operator as op
from collections import deque
from math import gcd, inf, sqrt
from bisect import bisect_right, bisect_left
from functools import reduce
from sys import stdin, stdout, setrecursionlimit
setrecursionlimit(2 ** 20)

def factorial(n):
	if n == 0:
		return 1
	return n * factorial(n - 1)

def ncr(n, r):
	r = min(r, n - r)
	numer = reduce(op.mul, range(n, n - r, -1), 1)
	denom = reduce(op.mul, range(1, r + 1), 1)
	return numer // denom

def prime_factors(n):
	i = 2
	factors = []
	while i * i <= n:
		if n % i:
			i += 1
		else:
			n //= i
			factors.append(i)
	if n > 1:
		factors.append(n)
	return len(set(factors))

def isPowerOfTwo(x):
	return x and (not x & x - 1)

def factors(n):
	return list(set(reduce(list.__add__, ([i, n // i] for i in range(1, int(n ** 0.5) + 1) if n % i == 0))))
MOD = 10 ** 9 + 9
T = 1
T = int(stdin.readline())
for _ in range(T):
	n = int(stdin.readline())
	if n % 4 == 0:
		print('YES')
	else:
		print('NO')


import os
import sys
from io import BytesIO, IOBase
import threading
from math import floor
from bisect import bisect_right
from collections import Counter
from math import gcd
mod = 998244353

def main():
	for _ in range(int(input())):
		n = int(input())
		if n % 4 == 0:
			print('YES')
		else:
			print('NO')
BUFSIZE = 8192

class FastIO(IOBase):
	newlines = 0

	def __init__(self, file):
		self._fd = file.fileno()
		self.buffer = BytesIO()
		self.writable = 'x' in file.mode or 'r' not in file.mode
		self.write = self.buffer.write if self.writable else None

	def read(self):
		while True:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
			if not b:
				break
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines = 0
		return self.buffer.read()

	def readline(self):
		while self.newlines == 0:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
			self.newlines = b.count(b'\n') + (not b)
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines -= 1
		return self.buffer.readline()

	def flush(self):
		if self.writable:
			os.write(self._fd, self.buffer.getvalue())
			(self.buffer.truncate(0), self.buffer.seek(0))

class IOWrapper(IOBase):

	def __init__(self, file):
		self.buffer = FastIO(file)
		self.flush = self.buffer.flush
		self.writable = self.buffer.writable
		self.write = lambda s: self.buffer.write(s.encode('ascii'))
		self.read = lambda : self.buffer.read().decode('ascii')
		self.readline = lambda : self.buffer.readline().decode('ascii')
(sys.stdin, sys.stdout) = (IOWrapper(sys.stdin), IOWrapper(sys.stdout))
input = lambda : sys.stdin.readline().rstrip('\r\n')
main()


import sys
input = sys.stdin.readline
I = lambda : list(map(int, input().split()))
(t,) = I()
for _ in range(t):
	(n,) = I()
	if n % 2:
		print('NO')
	elif n // 2 % 2:
		print('NO')
	else:
		print('YES')


import math

def main():
	t = Iint()
	for _ in range(t):
		n = Iint()
		if n % 4 == 0:
			print('YES')
		else:
			print('NO')

def I():
	return input()

def Iint():
	return int(input())

def Ilist():
	return list(map(int, input().split()))

def Imap():
	return map(int, input().split())

def Plist(li, s=' '):
	print(s.join(map(str, li)))
FIO = True
if FIO:
	from io import BytesIO, IOBase
	import sys
	import os
en = enumerate
if not FIO:
	if __name__ == '__main__':
		main()
		exit()
BUFSIZE = 8192

class FastIO(IOBase):
	newlines = 0

	def __init__(self, file):
		self._fd = file.fileno()
		self.buffer = BytesIO()
		self.writable = 'x' in file.mode or 'r' not in file.mode
		self.write = self.buffer.write if self.writable else None

	def read(self):
		while True:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
			if not b:
				break
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines = 0
		return self.buffer.read()

	def readline(self):
		while self.newlines == 0:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
			self.newlines = b.count(b'\n') + (not b)
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines -= 1
		return self.buffer.readline()

	def flush(self):
		if self.writable:
			os.write(self._fd, self.buffer.getvalue())
			(self.buffer.truncate(0), self.buffer.seek(0))

class IOWrapper(IOBase):

	def __init__(self, file):
		self.buffer = FastIO(file)
		self.flush = self.buffer.flush
		self.writable = self.buffer.writable
		self.write = lambda s: self.buffer.write(s.encode('ascii'))
		self.read = lambda : self.buffer.read().decode('ascii')
		self.readline = lambda : self.buffer.readline().decode('ascii')
(sys.stdin, sys.stdout) = (IOWrapper(sys.stdin), IOWrapper(sys.stdout))

def input():
	return sys.stdin.readline().rstrip('\r\n')
main()


def next():
	return [int(x) for x in input().split()]
(ca,) = next()
for _ in range(ca):
	(x,) = next()
	print('YES' if x % 4 == 0 else 'NO')


from sys import stdin as cin

def main():
	t = int(next(cin).strip())
	for i in range(t):
		n = int(next(cin).strip())
		print('YES' if n % 4 == 0 else 'NO')
main()


import os
import sys
debug = True
if debug and os.path.exists('input.in'):
	input = open('input.in', 'r').readline
else:
	debug = False
	input = sys.stdin.readline

def inp():
	return int(input())

def inlt():
	return list(map(int, input().split()))

def insr():
	s = input()
	return s[:len(s) - 1]

def invr():
	return map(int, input().split())
test_count = int(input())
for t in range(test_count):
	if debug:
		print('Test Case #', t + 1)
	n = inp()
	if n % 4 == 0:
		print('YES')
	else:
		print('NO')


def program(a):
	if a % 4 == 0:
		return 'yEs'
	return 'nO'
interesting = int(input())
for x in range(interesting):
	i = int(input())
	print(program(i))


import math
import sys
input = sys.stdin.readline
result = []
for i in range(int(input())):
	a = int(input())
	result.append('YES' if a % 4 == 0 else 'NO')
print('\n'.join(result))


from sys import stdin

def iinput():
	return int(stdin.readline())

def sinput():
	return input()

def minput():
	return map(int, stdin.readline().split())

def linput():
	return list(map(int, stdin.readline().split()))
t = iinput()
while t:
	t -= 1
	n = iinput()
	print('YES' if n % 4 == 0 else 'NO')


t = int(input())
yes_no = []
for i in range(t):
	n = int(input())
	if n % 4 == 0:
		yes_no.append('YES')
	else:
		yes_no.append('NO')
for j in yes_no:
	print(j)


t = int(input())
for i in range(0, t):
	n = int(input())
	a = 90 * n / 360
	if a % 1 == 0 and a < n and (a >= 1):
		print('YES')
	else:
		print('NO')


for i in range(int(input())):
	num = int(input())
	if num % 4:
		print('NO')
	else:
		print('YES')


import sys
input = sys.stdin.readline
(inp, ip) = (lambda : int(input()), lambda : [int(w) for w in input().split()])
for _ in range(inp()):
	n = inp()
	if n % 4 == 0:
		print('YES')
	else:
		print('NO')


from sys import stdin, stdout
readline = stdin.readline
write = stdout.write
t = int(readline())
for i in range(t):
	n = int(readline())
	write('NO\n' if n % 4 else 'YES\n')


import sys

def input():
	return sys.stdin.readline()[:-1]

def main():
	for _ in range(int(input())):
		n = int(input())
		if n % 4 == 0:
			print('YES')
		else:
			print('NO')
main()


import sys
input = sys.stdin.readline
T = int(input())
for testcase in range(T):
	n = int(input())
	if n % 4 == 0:
		print('YES')
	else:
		print('NO')


import sys
readline = sys.stdin.readline

def solve():
	n = int(readline())
	if n % 4 == 0:
		print('YES')
	else:
		print('NO')
T = int(readline())
for i in range(T):
	solve()


import sys, collections, math

def in_out():
	sys.stdin = open('input.txt', 'r')
	sys.stdout = open('output.txt', 'w')
for _ in range(int(input())):
	n = int(input())
	if n % 4 == 0:
		print('YES')
	else:
		print('NO')


tc = int(input())
for ctr in range(tc):
	n = int(input())
	if n % 4 == 0:
		print('YES')
	else:
		print('NO')


import sys
stdin = sys.stdin
stdout = sys.stdout
test = int(stdin.readline())
for t in range(test):
	n = int(stdin.readline())
	ans = 'YES' if n % 4 == 0 else 'NO'
	stdout.write(f'{ans}\n')


import sys
from collections import defaultdict as dd
from collections import deque
from fractions import Fraction as f
from copy import *
from bisect import *
from heapq import *
from itertools import permutations

def eprint(*args):
	print(*args, file=sys.stderr)
zz = 1
if zz:
	input = sys.stdin.readline
else:
	sys.stdin = open('input.txt', 'r')
	sys.stdout = open('all.txt', 'w')

def li():
	return [int(x) for x in input().split()]

def fi():
	return int(input())

def si():
	return list(input().rstrip())

def mi():
	return map(int, input().split())

def gh():
	sys.stdout.flush()

def graph(n, m):
	for i in range(m):
		(x, y) = mi()
		a[x].append(y)
		a[y].append(x)

def bo(i):
	return ord(i) - ord('a')
t = fi()
while t > 0:
	t -= 1
	n = fi()
	print('YES' if n % 4 == 0 else 'NO')


import sys
input = iter(sys.stdin.read().splitlines()).__next__
sys.setrecursionlimit(10000)
TC = int(input())
for tc in range(TC):
	N = int(input())
	print('YES' if N % 4 == 0 else 'NO')


t = int(input())
arr = []
while t:
	n = int(input())
	if n % 4 == 0:
		arr.append(1)
	else:
		arr.append(0)
	t -= 1
for i in arr:
	if i == 1:
		print('YES')
	else:
		print('NO')


from collections import defaultdict as dd
from collections import deque
import bisect
import heapq

def ri():
	return int(input())

def rl():
	return list(map(int, input().split()))

def solve():
	if ri() % 4 == 0:
		print('YES')
	else:
		print('NO')
mode = 'T'
if mode == 'T':
	t = ri()
	for i in range(t):
		solve()
else:
	solve()


import sys
import math
import random
input = sys.stdin.readline

def inp():
	return int(input())

def inara():
	return list(map(int, input().split()))

def insr():
	s = input()
	return list(s[:len(s) - 1])

def invr():
	return map(int, input().split())
t = inp()
for _ in range(t):
	n = inp()
	if n % 2 == 0 and n // 2 % 2 == 0:
		print('YES')
	else:
		print('NO')


t = int(input())
for t in range(t):
	p = int(input())
	if p != 0 and p % 4 == 0:
		print('Yes')
	else:
		print('No')


import sys
n = int(sys.stdin.readline().strip())
answ = []
for _ in range(n):
	num = int(sys.stdin.readline().strip())
	answ.append('NO' if num % 4 else 'YES')
for i in answ:
	print(i)


import math
import os
import random
import re
import sys
t = int(input())
for i in range(t):
	n = int(input())
	if n % 4 == 0:
		print('YES')
	else:
		print('NO')


for t in range(int(input())):
	n = int(input())
	t = 0 if n % 4 == 0 else 1
	print('YNEOS'[t::2])


pt = int(input())
for i in range(pt):
	pn = int(input())
	if pn % 4 == 0:
		print('YES')
	else:
		print('NO')


def fun(num):
	if num % 4 == 0:
		print('YES')
	else:
		print('NO')
T = int(input())
for i in range(T):
	x = int(input())
	fun(x)


import sys
input = sys.stdin.readline
ans = []
for kek in range(int(input())):
	n = int(input())
	if 90 * n % 360 == 0:
		ans.append('YES')
	else:
		ans.append('NO')
print(*ans, sep='\n')


import sys
input = lambda : sys.stdin.readline().strip()
t = int(input())
while t:
	t -= 1
	n = int(input())
	if n % 4 == 0:
		print('YES')
	else:
		print('NO')


for I in range(int(input())):
	n = int(input())
	temp = 360 / n
	if n % 4 == 0:
		print('YES')
	else:
		print('NO')


k = int(input())
m = []
for a in range(k):
	j = int(input())
	m.append(j)
for i in m:
	if i % 4 == 0:
		print('YES')
	else:
		print('NO')


from sys import stdin

def readline():
	return stdin.readline()
tests = int(readline())

def solve(n):
	if n % 4 == 0:
		return 'YES'
	return 'NO'
for t in range(0, tests):
	n = int(readline().rstrip('\n'))
	print(solve(n))


def gen_primes():
	D = {}
	q = 2
	while True:
		if q not in D:
			yield q
			D[q * q] = [q]
		else:
			for p in D[q]:
				D.setdefault(p + q, []).append(p)
			del D[q]
		q += 1

def read_line(type=int):
	return list(map(type, input().split()))

def sum_from_1_to_(i):
	return i * (i + 1) // 2

def is_odd(a):
	return a % 2 == 0
t = int(input())
for _ in range(t):
	n = int(input())
	print('YES' if n % 4 == 0 else 'NO')


t = int(input())
ans = []
for i in range(t):
	n = int(input())
	if n < 3:
		ans.append('NO')
		continue
	if n % 4 == 0:
		ans.append('YES')
		continue
	else:
		ans.append('NO')
for an in ans:
	print(an)


def mi():
	return map(int, input().split())
for _ in range(int(input())):
	n = int(input())
	if n % 4 == 0:
		print('YES')
	else:
		print('NO')


import math, itertools, fractions, heapq, collections, bisect, sys, queue, copy
sys.setrecursionlimit(10 ** 7)
inf = 10 ** 20
mod = 10 ** 9 + 7
dd = [(-1, 0), (0, 1), (1, 0), (0, -1)]
ddn = [(-1, 0), (-1, 1), (0, 1), (1, 1), (1, 0), (1, -1), (0, -1), (-1, -1)]

def LI():
	return [int(x) for x in sys.stdin.readline().split()]

def I():
	return int(sys.stdin.readline())

def F():
	return float(sys.stdin.readline())

def LS():
	return sys.stdin.readline().split()

def S():
	return input()

def main():
	n = I()
	ans = []
	for _ in range(n):
		a = I()
		if a % 4 == 0:
			ans.append('YES')
		else:
			ans.append('NO')
	for x in ans:
		print(x)
main()


import sys
import math
from collections import defaultdict

def solve(test):
	n = int(input())
	if n % 4 == 0:
		print('YES')
	else:
		print('NO')
test_cases = int(input())
for t in range(1, test_cases + 1):
	solve(t)


import bisect
import decimal
from decimal import Decimal
import os
from collections import Counter
import bisect
from collections import defaultdict
import math
import random
import heapq
from math import sqrt
import sys
from functools import reduce, cmp_to_key
from collections import deque
import threading
from itertools import combinations
from io import BytesIO, IOBase
from itertools import accumulate
decimal.getcontext().prec = 46

def primeFactors(n):
	prime = set()
	while n % 2 == 0:
		prime.add(2)
		n = n // 2
	for i in range(3, int(math.sqrt(n)) + 1, 2):
		while n % i == 0:
			prime.add(i)
			n = n // i
	if n > 2:
		prime.add(n)
	return list(prime)

def getFactors(n):
	factors = []
	i = 1
	while i <= math.sqrt(n):
		if n % i == 0:
			if n // i == i:
				factors.append(i)
			else:
				factors.append(i)
				factors.append(n // i)
		i = i + 1
	return factors

def SieveOfEratosthenes(n):
	prime = [True for i in range(n + 1)]
	p = 2
	while p * p <= n:
		if prime[p] == True:
			for i in range(p * p, n + 1, p):
				prime[i] = False
		p += 1
	num = []
	for p in range(2, n + 1):
		if prime[p]:
			num.append(p)
	return num

def lcm(a, b):
	return a * b // math.gcd(a, b)

def sort_dict(key_value):
	return sorted(key_value.items(), key=lambda kv: (kv[1], kv[0]))

def list_input():
	return list(map(int, input().split()))

def num_input():
	return map(int, input().split())

def string_list():
	return list(input())

def decimalToBinary(n):
	return bin(n).replace('0b', '')

def binaryToDecimal(n):
	return int(n, 2)

def DFS(n, s, adj):
	visited = [False for i in range(n)]
	stack = []
	stack.append(s)
	while len(stack):
		s = stack[-1]
		stack.pop()
		if not visited[s]:
			visited[s] = True
		for node in adj[s]:
			if not visited[node]:
				stack.append(node)

def solve():
	n = int(input())
	if n % 2 == 0 and n % 4 == 0:
		print('YES')
		return
	print('NO')
t = int(input())
for _ in range(t):
	solve()


import io
import os
from collections import Counter, defaultdict, deque

def solve(N):
	if N % 4 == 0:
		return 'YES'
	return 'NO'
input = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline
T = int(input())
for t in range(T):
	(N,) = [int(x) for x in input().split()]
	ans = solve(N)
	print(ans)


def checkPolygon(sides):
	for i in range(len(sides)):
		if sides[i] % 4 == 0:
			print('YES')
		else:
			print('NO')

def main():
	count = int(input())
	sideList = []
	for x in range(count):
		polygonSides = int(input())
		sideList.append(polygonSides)
	f = checkPolygon(sideList)
	f
main()


k = int(input(''))
t = []
for x in range(k):
	t.append(int(input()))
for y in t:
	j = y % 4
	if j == 0:
		print('YES')
	else:
		print('NO')


tc = int(input())
result = []
for i in range(tc):
	n = int(input())
	if n % 4 == 0:
		result.append('YES')
	else:
		result.append('NO')
for t in result:
	print(t)


import math

def main():
	n = int(input())
	if n % 4 == 0 and n != 0:
		print('YES')
	else:
		print('NO')

def test():
	t = int(input())
	while t:
		main()
		t -= 1
test()


ll = lambda : list(map(int, input().split()))
st = lambda : input()
v = lambda : map(int, input().split())
ii = lambda : int(input())
for _ in range(ii()):
	n = ii()
	if n % 4 != 0:
		print('NO')
	else:
		print('YES')


import os
import sys
from math import *
from collections import *
from fractions import *
from bisect import *
from heapq import *
from io import BytesIO, IOBase

def vsInput():
	sys.stdin = open('input.txt', 'r')
	sys.stdout = open('output.txt', 'w')
BUFSIZE = 8192

class FastIO(IOBase):
	newlines = 0

	def __init__(self, file):
		self._fd = file.fileno()
		self.buffer = BytesIO()
		self.writable = 'x' in file.mode or 'r' not in file.mode
		self.write = self.buffer.write if self.writable else None

	def read(self):
		while True:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
			if not b:
				break
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines = 0
		return self.buffer.read()

	def readline(self):
		while self.newlines == 0:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
			self.newlines = b.count(b'\n') + (not b)
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines -= 1
		return self.buffer.readline()

	def flush(self):
		if self.writable:
			os.write(self._fd, self.buffer.getvalue())
			(self.buffer.truncate(0), self.buffer.seek(0))

class IOWrapper(IOBase):

	def __init__(self, file):
		self.buffer = FastIO(file)
		self.flush = self.buffer.flush
		self.writable = self.buffer.writable
		self.write = lambda s: self.buffer.write(s.encode('ascii'))
		self.read = lambda : self.buffer.read().decode('ascii')
		self.readline = lambda : self.buffer.readline().decode('ascii')
(sys.stdin, sys.stdout) = (IOWrapper(sys.stdin), IOWrapper(sys.stdout))
input = lambda : sys.stdin.readline().rstrip('\r\n')

def value():
	return tuple(map(int, input().split()))

def array():
	return [int(i) for i in input().split()]

def Int():
	return int(input())

def Str():
	return input()

def arrayS():
	return [i for i in input().split()]
for _ in range(Int()):
	n = Int()
	if n < 4:
		print('NO')
	else:
		n -= 4
		if n % 4 == 0:
			print('YES')
		else:
			print('NO')


import math
for i in range(int(input())):
	n = int(input())
	if n % 4 == 0:
		print('YES')
		continue
	print('NO')


a = int(input())
collections = []
for i in range(a):
	let = int(input())
	collections.append(let)
for collection in collections:
	if collection % 4 == 0:
		print('YES')
	else:
		print('NO')


import sys
input = sys.stdin.readline

def inp():
	return int(input())

def instr():
	return str(input())

def inlt():
	return list(map(int, input().split()))

def insr():
	s = input()
	return list(s[:len(s) - 1])

def invr():
	return map(int, input().split())
from collections import Counter

def main():
	t = inp()
	for _ in range(t):
		n = inp()
		if n % 4 == 0:
			print('YES')
		else:
			print('NO')
main()


Nside = int(input())
Numbers = []
Result = []
for num in range(0, Nside):
	Numbers.append(int(input()))
Result = ['YES' if num % 4 == 0 else 'NO' for num in Numbers]
print(*Result, sep='\n')


import math

def is_prime(n):
	num = int(math.sqrt(n)) + 1
	for i in range(2, num):
		if n % i == 0:
			return False
	return True
t = int(input())
for _ in range(t):
	n = int(input())
	if n % 4 != 0:
		print('NO')
	else:
		print('YES')


import sys
input = sys.stdin.readline
t = int(input())
for ti in range(1, t + 1):
	n = int(input())
	if n % 4:
		print('NO')
	else:
		print('YES')


import sys
import bisect as b
import math
from collections import defaultdict as dd
input = sys.stdin.readline
mo = 10 ** 9 + 7

def cin():
	return map(int, sin().split())

def ain():
	return list(map(int, sin().split()))

def sin():
	return input()

def inin():
	return int(input())

def pref(a, n, f):
	pre = [0] * n
	if f == 0:
		pre[0] = a[0]
		for i in range(1, n):
			pre[i] = a[i] + pre[i - 1]
	else:
		pre[-1] = a[-1]
		for i in range(n - 2, -1, -1):
			pre[i] = pre[i + 1] + a[i]
	return pre

def dfs(node, ans):
	vi[node] = 1
	ans += [node + 1]
	for j in adj[node]:
		if vi[j] == 0:
			dfs(j, ans)
	return ans
for i in range(inin()):
	n = inin()
	if n % 4 != 0:
		print('NO')
	else:
		print('YES')


from collections import deque
import copy
for i in range(int(input())):
	n = int(input())
	if n % 4 == 0:
		print('YES')
	else:
		print('NO')


m = int(input())
l = []
for i in range(m):
	a = int(input())
	l.append('YES' if a % 4 == 0 else 'NO')
for i in l:
	print(i)


q = int(input())
for i in range(q):
	y = int(input())
	count_one = 0
	count_0 = 0
	try:
		if y % 4 == 0:
			print('YES')
		else:
			print('NO')
	except:
		print(0)


for ew in range(int(input())):
	if int(input()) % 4 == 0:
		print('YES')
	else:
		print('NO')


test = int(input())
for x in range(test):
	n = int(input())
	if n <= 3:
		print('NO')
	elif n % 4 == 0 or n % 8 == 0 or n % 12 == 0:
		print('YES')
	else:
		print('NO')


try:
	for _ in range(int(input())):
		n = int(input())
		if n % 4 == 0:
			print('YES')
		else:
			print('NO')
except EOFError:
	pass


z = int(input())
for w in range(z):
	n = int(input())
	if n == 3:
		print('NO')
	elif n == 4:
		print('YES')
	else:
		n = n - 4
		if n % 2 != 0:
			print('NO')
		else:
			n = n / 2
			if n % 2 == 0:
				print('YES')
			else:
				print('NO')


import os
import sys
from io import BytesIO, IOBase
BUFSIZE = 8192

class FastIO(IOBase):
	newlines = 0

	def __init__(self, file):
		self._fd = file.fileno()
		self.buffer = BytesIO()
		self.writable = 'x' in file.mode or 'r' not in file.mode
		self.write = self.buffer.write if self.writable else None

	def read(self):
		while True:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
			if not b:
				break
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines = 0
		return self.buffer.read()

	def readline(self):
		while self.newlines == 0:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
			self.newlines = b.count(b'\n') + (not b)
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines -= 1
		return self.buffer.readline()

	def flush(self):
		if self.writable:
			os.write(self._fd, self.buffer.getvalue())
			(self.buffer.truncate(0), self.buffer.seek(0))

class IOWrapper(IOBase):

	def __init__(self, file):
		self.buffer = FastIO(file)
		self.flush = self.buffer.flush
		self.writable = self.buffer.writable
		self.write = lambda s: self.buffer.write(s.encode('ascii'))
		self.read = lambda : self.buffer.read().decode('ascii')
		self.readline = lambda : self.buffer.readline().decode('ascii')
(sys.stdin, sys.stdout) = (IOWrapper(sys.stdin), IOWrapper(sys.stdout))
input = lambda : sys.stdin.readline().rstrip('\r\n')
from math import factorial
from collections import Counter, defaultdict, deque
from heapq import heapify, heappop, heappush

def RL():
	return map(int, sys.stdin.readline().rstrip().split())

def RLL():
	return list(map(int, sys.stdin.readline().rstrip().split()))

def N():
	return int(input())

def comb(n, m):
	return factorial(n) / (factorial(m) * factorial(n - m)) if n >= m else 0

def perm(n, m):
	return factorial(n) // factorial(n - m) if n >= m else 0

def mdis(x1, y1, x2, y2):
	return abs(x1 - x2) + abs(y1 - y2)
mod = 998244353
INF = float('inf')

def main():
	for _ in range(N()):
		n = N()
		one = 360 / n
		time = 90 / one
		if 90 * n % 360 == 0:
			print('YES')
		else:
			print('NO')
main()


import sys
input = lambda : sys.stdin.readline().strip()
li = lambda : list(map(int, input().split()))
I = lambda : int(input())
for _ in range(I()):
	n = I()
	if n % 4 == 0:
		print('YES')
	else:
		print('NO')


n = int(input())
l = []
for i in range(n):
	m = int(input())
	l.append(m)
for j in l:
	if j % 4 == 0:
		print('YES')
	else:
		print('NO')


def fun(n):
	if n % 4 == 0:
		return True
	else:
		return False
t = int(input())
for i in range(t):
	n = int(input())
	ans = fun(n)
	print('YES') if ans else print('NO')


import sys
from collections import defaultdict as dd
from collections import Counter as cc
from queue import Queue
import math
import itertools
try:
	sys.stdin = open('input.txt', 'r')
	sys.stdout = open('output.txt', 'w')
except:
	pass
input = lambda : sys.stdin.buffer.readline().rstrip()
for _ in range(int(input())):
	q = int(input())
	if q % 4 == 0:
		print('YES')
	else:
		print('NO')


import math as mt
import sys, string
input = sys.stdin.readline
L = lambda : list(map(int, input().split()))
Ls = lambda : list(input().split())
M = lambda : map(int, input().split())
I = lambda : int(input())
t = I()
for _ in range(t):
	n = I()
	if n % 4 == 0:
		print('YES')
	else:
		print('NO')


n = int(input())
for i in range(n):
	s = int(input())
	if s % 4 == 0 and s != 1:
		print('YES')
	else:
		print('NO')


import sys
import math
import heapq
from collections import defaultdict, deque
input = sys.stdin.readline

def r():
	return int(input())

def rm():
	return map(int, input().split())

def rl():
	return list(map(int, input().split()))
for _ in range(r()):
	n = int(input())
	if (n - 4) % 4 == 0:
		print('YES')
	else:
		print('NO')


a = int(input())
for k in range(a):
	b = int(input())
	if b % 4 == 0:
		print('YES')
	else:
		print('NO')


from fractions import Fraction
tests = int(input())
for i in range(tests):
	n = int(input())
	angle = 180 - Fraction(180 * (n - 2), n)
	if 90 % angle == 0:
		print('YES')
	else:
		print('NO')


import math
import sys
from sys import *
from bisect import insort
import heapq
import collections
from collections import deque, defaultdict
from itertools import permutations, combinations, combinations_with_replacement
import random
import os
mod = 10 ** 9 + 7
MAX = sys.maxsize
MIN = -sys.maxsize - 1

def isPrime(n):
	if n > 1:
		for i in range(2, n):
			if n % i == 0:
				return False
		else:
			return True
	else:
		return False

def isPanagram(s):
	alphabet = 'abcdefghijklmnopqrstuvwxyz'
	for char in alphabet:
		if char not in s.lower():
			return False
	return True

def isEqual(list1):
	if len(list1) < 0:
		res = True
	res = all((ele == list1[0] for ele in list1))
	if res:
		return True
	else:
		return False

def remove_duplicate(list1):
	final_list = []
	for i in list1:
		if i not in final_list:
			final_list.append(i)
	return final_list % mod

def solve():
	n = int(input())
	if n % 4 == 0:
		return 'YES'
	return 'NO'
t = int(stdin.readline())
for i in range(t):
	result = solve()
	stdout.write(str(result) + '\n')


for i in [*open(0)][1:]:
	i = int(i)
	if i % 4 == 0:
		print('YES')
	else:
		print('NO')


import operator as op
import re
import sys
from bisect import bisect, bisect_left, insort, insort_left
from collections import Counter, defaultdict, deque
from copy import deepcopy
from decimal import Decimal
from functools import reduce
from itertools import accumulate, combinations, combinations_with_replacement, groupby, permutations, product
from math import acos, asin, atan, ceil, cos, degrees, factorial, gcd, hypot, log2, pi, radians, sin, sqrt, tan
from operator import itemgetter, mul
from string import ascii_lowercase, ascii_uppercase, digits

def inp():
	return int(input())

def inlist():
	return list(map(int, input().split()))

def instr():
	s = input()
	return list(s[:len(s)])

def invr():
	return map(int, input().split())

def def_value():
	return 0
t = inp()
for _ in range(t):
	n = inp()
	if n % 4 == 0:
		print('YES')
	else:
		print('NO')


import math
import os
import random
import re
import sys

def polygon_acceptance(polygon):
	for i in polygon:
		if i % 4 == 0:
			print('YES')
		else:
			print('NO')
input_count = int(input().strip())
polygon = []
for _ in range(input_count):
	polygon_size = int(input().strip())
	polygon.append(polygon_size)
result = polygon_acceptance(polygon)


def lee(number):
	if number % 4 == 0:
		print('YES')
	else:
		print('NO')
test_case = int(input())
for i in range(test_case):
	lee(int(input()))


def solve():
	if int(input()) % 4:
		print('No')
	else:
		print('Yes')
for i in range(int(input())):
	solve()


t = int(input())
for _ in range(t):
	n = int(input())
	if n > 1 and n % 4 == 0:
		print('YES')
	else:
		print('NO')


import sys

def input():
	return sys.stdin.readline().strip()

def list2d(a, b, c):
	return [[c] * b for i in range(a)]

def list3d(a, b, c, d):
	return [[[d] * c for j in range(b)] for i in range(a)]

def list4d(a, b, c, d, e):
	return [[[[e] * d for j in range(c)] for j in range(b)] for i in range(a)]

def ceil(x, y=1):
	return int(-(-x // y))

def INT():
	return int(input())

def MAP():
	return map(int, input().split())

def LIST(N=None):
	return list(MAP()) if N is None else [INT() for i in range(N)]

def Yes():
	print('Yes')

def No():
	print('No')

def YES():
	print('YES')

def NO():
	print('NO')
INF = 10 ** 19
MOD = 10 ** 9 + 7
for _ in range(INT()):
	N = INT()
	if N % 4 == 0:
		YES()
	else:
		NO()


from __future__ import division, print_function
import os
import sys
from io import BytesIO, IOBase
if sys.version_info[0] < 3:
	from __builtin__ import xrange as range
	from future_builtins import ascii, filter, hex, map, oct, zip
BUFSIZE = 8192

class FastIO(IOBase):
	newlines = 0

	def __init__(self, file):
		self._fd = file.fileno()
		self.buffer = BytesIO()
		self.writable = 'x' in file.mode or 'r' not in file.mode
		self.write = self.buffer.write if self.writable else None

	def read(self):
		while True:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
			if not b:
				break
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines = 0
		return self.buffer.read()

	def readline(self):
		while self.newlines == 0:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
			self.newlines = b.count(b'\n') + (not b)
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines -= 1
		return self.buffer.readline()

	def flush(self):
		if self.writable:
			os.write(self._fd, self.buffer.getvalue())
			(self.buffer.truncate(0), self.buffer.seek(0))

class IOWrapper(IOBase):

	def __init__(self, file):
		self.buffer = FastIO(file)
		self.flush = self.buffer.flush
		self.writable = self.buffer.writable
		self.write = lambda s: self.buffer.write(s.encode('ascii'))
		self.read = lambda : self.buffer.read().decode('ascii')
		self.readline = lambda : self.buffer.readline().decode('ascii')

def print(*args, **kwargs):
	(sep, file) = (kwargs.pop('sep', ' '), kwargs.pop('file', sys.stdout))
	at_start = True
	for x in args:
		if not at_start:
			file.write(sep)
		file.write(str(x))
		at_start = False
	file.write(kwargs.pop('end', '\n'))
	if kwargs.pop('flush', False):
		file.flush()
if sys.version_info[0] < 3:
	(sys.stdin, sys.stdout) = (FastIO(sys.stdin), FastIO(sys.stdout))
else:
	(sys.stdin, sys.stdout) = (IOWrapper(sys.stdin), IOWrapper(sys.stdout))
from math import sqrt, floor, factorial, gcd, log
from collections import deque, Counter, defaultdict
from itertools import permutations, combinations
from math import gcd
from bisect import bisect
input = lambda : sys.stdin.readline().rstrip('\r\n')
read = lambda : list(map(int, input().strip().split(' ')))

def solve():
	for _ in range(int(input())):
		print('YNEOS'[int(input()) % 4 > 0::2])
solve()


t = int(input())
for q in range(t):
	n = int(input())
	ug = (n - 2) * 180 / n
	if n % 4 == 0:
		print('YES')
	else:
		print('NO')


from math import *
sInt = lambda : int(input())
mInt = lambda : map(int, input().split())
lInt = lambda : list(map(int, input().split()))
t = sInt()
for _ in range(t):
	a = sInt()
	if a % 4 == 0:
		print('YES')
	else:
		print('NO')


import sys

def debug(*args):
	return 0

def main(status=int(0)):

	def cout(*args):
		for current_elm in args:
			sys.stdout.write('{}'.format(current_elm))
	for _ in range(int(input())):
		cout('YES\n' if int(input()) % 4 == 0 else 'NO\n')
main()
debug()


import math
import os
import random
import re
import sys
MIN_N = 3

def is_beautiful(p):
	if p % 4 == 0:
		return 'YES'
	return 'NO'

def solve(n):
	for _ in range(n):
		polygon = int(input())
		print(is_beautiful(polygon))
n = int(input())
result = solve(n)


for _ in range(int(input())):
	n = int(input())
	if n % 2 == 0:
		if n == 6 or n % 4 == 0:
			print('YES')
		else:
			print('NO')
	else:
		print('NO')


cases = int(input())
for i in range(cases):
	edges = int(input())
	if 90 * edges % 360 == 0:
		print('YES')
	else:
		print('NO')


from collections import Counter
import math
import sys
from bisect import bisect, bisect_left, bisect_right

def input():
	return sys.stdin.readline().strip()

def INT():
	return int(input())

def MAP():
	return map(int, input().split())

def LIST(N=None):
	return list(MAP()) if N is None else [INT() for i in range(N)]

def mod():
	return 10 ** 9 + 7
for i in range(INT()):
	n = INT()
	if n % 4 == 0:
		print('YES')
	else:
		print('NO')


N = int(input())
f = lambda n: (n - 4) % 4 == 0 if n >= 4 else False
for _ in range(N):
	n = int(input())
	print('YES' if f(n) else 'NO')


n = int(input(''))
list = []
for i in range(n):
	list.extend(input('').split(' '))
for i in list:
	if int(i) % 4 == 0:
		print('YES')
	else:
		print('NO')


import sys, math
wtf = sys.stdin.read()
wtf = wtf.strip().split('\n')
for cs in wtf[1:]:
	n = int(cs)
	print('YES' if n % 4 == 0 else 'NO')


import sys
from fractions import gcd
from math import ceil, sqrt, sin, pi, tan
from collections import defaultdict
read = sys.stdin.buffer.readline
import heapq
mi = lambda : map(int, read().split())
li = lambda : list(mi())
cin = lambda : int(read())
for _ in range(cin()):
	n = cin()
	if n % 4 == 0:
		print('YES')
	else:
		print('NO')


my_value = []
for i in range(int(input())):
	temp = int(input())
	if temp % 4 == 0:
		my_value.append('YES')
	else:
		my_value.append('NO')
for i in my_value:
	print(i)


def FashionabLee(n):
	if n % 4 == 0:
		return 'YES'
	return 'NO'
Lista = []
total = int(input())
for i in range(total):
	Lista.append(int(input()))
for j in Lista:
	print(FashionabLee(j))


def solution(l1):
	i = 0
	while i < len(l1):
		print('YES' * (l1[i] % 4 == 0) + 'NO' * (l1[i] % 4 != 0))
		i += 1

def answer():
	n = int(input())
	l1 = []
	while n:
		l1.append(int(input()))
		n -= 1
	solution(l1)
answer()


for _ in range(int(input())):
	n = int(input())
	if 90 * n % 360:
		print('NO')
	else:
		print('YES')


n = input('')
n = int(n)
str = []
for i in range(n):
	str.append(int(input('')))
for k in str:
	if k < 4:
		print('NO')
	elif k % 4 == 0:
		print('YES')
	else:
		print('NO')


def ans(n):
	if n % 4 == 0:
		return 'YES'
	return 'NO'
m = int(input())
for i in range(m):
	a = int(input())
	print(ans(a))


from sys import stdin, stdout
q = int(input())
for i in range(q):
	n = int(input())
	if n % 4 == 0:
		print('YES')
	else:
		print('NO')


import math

def list_input():
	return list(map(int, input().split()))

def multiple_input():
	return map(int, input().split())
for _ in range(int(input())):
	n = int(input())
	if n % 4 == 0:
		print('YES')
	else:
		print('NO')


import math
import os
import random
import re
import sys
import collections

def solve():
	for _ in range(int(input())):
		n = int(input())
		if n % 4 == 0:
			print('YES')
		else:
			print('NO')
solve()


from sys import stdin, stdout
import math, queue, heapq
fastinput = stdin.readline
fastout = stdout.write
t = int(fastinput())
while t:
	t -= 1
	n = int(fastinput())
	if n % 4 == 0:
		print('YES')
	else:
		print('NO')


def func(x):
	if x % 4 == 0:
		return 'YES'
	else:
		return 'NO'

def main():
	for i in list(map(func, [int(input()) for i in range(int(input()))])):
		print(i)
main()


cases = input()
l = []
for i in range(int(cases)):
	l.append(input())
for i in l:
	if int(i) % 4 == 0:
		print('YES')
	else:
		print('NO')


t = int(input())
p = []
for i in range(t):
	y = int(input())
	p.append(y)
for i in range(t):
	if int(0.25 * p[i]) == float(0.25 * p[i]):
		print('YES')
	else:
		print('NO')


times = int(input())
answer = []
for i in range(times):
	a = int(input())
	if a % 4 == 0:
		answer.append('YES')
	else:
		answer.append('NO')
for i in answer:
	print(i)


import math
import datetime
import collections
import statistics
import itertools

def is_prime(num):
	for i in range(2, int(math.sqrt(num)) + 1):
		if num % i == 0:
			return False
	return True

def input_list():
	ll = list(map(int, input().split(' ')))
	return ll
tc = int(input())
for _ in range(tc):
	n = int(input())
	if n % 4 == 0:
		print('YES')
	else:
		print('NO')


from sys import stdin
from bisect import bisect_left as bl
from bisect import bisect_right as br

def input():
	return stdin.readline()[:-1]

def intput():
	return int(input())

def sinput():
	return input().split()

def intsput():
	return map(int, sinput())

class RangedList:

	def __init__(self, start, stop, val=0):
		self.shift = 0 - start
		self.start = start
		self.stop = stop
		self.list = [val] * (stop - start)

	def __setitem__(self, key, value):
		self.list[key + self.shift] = value

	def __getitem__(self, key):
		return self.list[key + self.shift]

	def __repr__(self):
		return str(self.list)

	def __iter__(self):
		return iter(self.list)

def dprint(*args, **kwargs):
	if debugging:
		print(*args, **kwargs)
debugging = 1
t = intput()
for _ in range(t):
	n = intput()
	a = 360
	b = n
	if 90 * b % a == 0:
		print('YES')
	else:
		print('NO')