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 ≤ t ≤ 10^4) — the number of polygons in the market. 

Each of the next t lines contains a single integer n_i (3 ≤ n_i ≤ 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>
#CF-650 (DIV-3)

'''test=int(input())
for i in range(test):
    b=input()
    ans=""
    if len(b)==2:
        ans=b
    else:
        ans+=b[0]
        j=1
        while j<len(b)-1:
            ans+=b[j]
            j+=2
        ans+=b[-1]
    print(ans)
'''
'''test=int(input())
for i in range(test):
    n=int(input())
    arr=[int(i) for i in input().split()]
    type1=0
    type2=0
    for i in range(n):
        if i%2==0 and arr[i]%2==1:
            type1+=1
        elif i%2==1 and arr[i]%2==0:
            type2+=1
    if type1!=type2:
        print(-1)
    else:
        print(type1)'''


'''test=int(input())
for i in range(test):
    n,k=[int(i) for i in input().split()]
    binary=input()
    suff=[float("inf")]*(n)
    suff[-1]=0 if binary[-1]=="1" else float("inf")
    for j in range(len(binary)-2,-1,-1):
        if binary[j]=="1":
            suff[j]=0
        else:
            suff[j]=1+suff[j+1]
    last=-1
    ans=0
    for i in range(len(binary)):
        if binary[i]=="0":
            if last!=-1:
                if i-last>k and suff[i]>k:
                    ans+=1
                    last=i
            elif suff[i]>k:
                ans+=1
                last=i
        else:
            last=i
    print(ans)'''


'''test=int(input())
for i in range(test):
    import heapq
    s=input()
    m=int(input())
    arr=[int(i) for i in input().split()]
    s=sorted("".join([i for i in s]))
    heap=[]
    for i in range(m):
        heapq.heappush(heap,(arr[i],i))
    ans=[""]*(m)
    t=0
    while heap:
        a,b=heapq.heappop(heap)
        while True:
            sum_=0
            for i in range(m):
                if ans[i]!="":
                    sum_+=abs(b-i)
            if sum_==a:
                break
            else:
                t+=1
        ans[b]=s[t]
    print("".join(ans))'''

#CODEFORCES GLOBAL ROUND

'''test=int(input())
for i in range(test):
    a,b,n=[int(i) for i in input().split()]
    ans=0
    while a<=n and b<=n:
        if a>=b:
            b+=a
        else:
            a+=b
        ans+=1
    print(ans)'''

'''k=int(input())
item="codeforces"
print(item,end="")
printable=10**(3)
s="s"*(10**(3))
k-=1
while k>printable:
    print(s,end="")
    k-=printable
print("s"*(k))'''

# codeforces 651 DIV-2

'''test=int(input())
for i in range(test):
    n=int(input())
    l=1
    r=n
    ans=1
    while l<=r:
        mid=l+(r-l)//2
        if mid*2<=n:
            ans=mid
            l=mid+1
        else:
            r=mid-1
    print(ans) '''


'''test=int(input())
for i in range(test):
    n=int(input())
    if n==1:
        print("FastestFinger")
    elif n%2:
        print("Ashishgup")
    elif n==2:
        print("Ashishgup")
    elif n&(n-1)==0:
        print("FastestFinger")
    else:
        res=[]
        i=2
        while i**2<=n:
            cnt=0
            while n%i==0:
                n=n//i
                cnt+=1
            res.append((i,cnt))
            i+=1
            #print(i,n)
        if n>1:
            res.append((n,1))
        prime=0
        alpha=0
        for i in res:
            if i[0]!=2:
                prime+=i[1] 
            else:
                alpha=i[1]
        if alpha>1:
            print("Ashishgup")
        elif prime>=2:
            print("Ashishgup")
        else:
            print("FastestFinger")'''

'''n,k=[int(i) for i in input().split()]
arr=[int(i) for i in input().split()]
'''

'''test=int(input())
for i in range(test):
    n=int(input())
    arr=[int(i) for i in input().split()]
    eve=[]
    odd=[]
    if n==2:
        print(3,4,sep=" ")
    else:
        for i in range(len(arr)):
            if arr[i]%2:
                odd.append(i)
            else:
                eve.append(i)
        if len(odd)%2:
            odd.pop()
            eve.pop()
        else:
            if len(eve)>=2:
                eve.pop()
                eve.pop()
            else:
                odd.pop()
                odd.pop()
        j=0
        while j<len(odd):
            print(odd[j]+1,odd[j+1]+1)
            j+=2
        k=0
        while k<len(eve):
            print(eve[k]+1,eve[k+1]+1)
            k+=2'''
    


'''n,k=[int(i) for i in input().split()]
arr=[int(i) for i in input().split()]

def check(x,p):
    ans=0
    for i in range(len(arr)):
        if (not p):
            ans+=1
            p^=1
        else:
            if arr[i]<=x:
                ans+=1
                p^=1
    return ans>=k

l=1
r=10**9
res=0

while l<=r:
    mid=l+(r-l)//2
    if check(mid,0) or check(mid,1):
        res=mid
        r=mid-1
    else:
        l=mid+1
print(res)
'''
                
#ATCODER BEGINNER
# CODEFORCESDIV-2 ROUND 652

test=int(input())
for i in range(test):
    n=int(input())
    if n==3:
        print("NO")
    elif (n-2)%2:
        print("NO")
    else:
        if ((n-2)//2)%2:
            print("YES")
        else:
            print("NO")
'''
test=int(input())
for i in range(test):
    s=input()'''



