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>
import java.util.*;
import java.lang.*;
import java.io.*;
import java.util.Arrays;


public class X
{   
   
	public static void main (String[] args) throws java.lang.Exception
	{
		Scanner s= new Scanner(System.in);
                int tc;
                tc=s.nextInt();
            
                while(tc>0)
                {   int n,m;
                    n=s.nextInt();
                    
                  // int a[]=new int[n];
                
                  // for(int i=0;i<n;i++)
                   //  a[i]=s.nextInt();
              
              if(n==3)
              System.out.println("NO");
              else
              {
              
    //          int c=n/4;
              
      //          int in=180-(360/n);
        //        int st=0;
               
           //     st=c*(180-in);
                
            //    if(st==90)
              if(n%4==0)
                  System.out.println("YES");
                  else
                  System.out.println("NO");
               }
               
               tc--;
                }
		  
		}
}

