Polycarp remembered the 2020-th year, and he is happy with the arrival of the new 2021-th year. To remember such a wonderful moment, Polycarp wants to represent the number n as the sum of a certain number of 2020 and a certain number of 2021.

For example, if: 

  * n=4041, then the number n can be represented as the sum 2020 + 2021; 
  * n=4042, then the number n can be represented as the sum 2021 + 2021; 
  * n=8081, then the number n can be represented as the sum 2020 + 2020 + 2020 + 2021; 
  * n=8079, then the number n cannot be represented as the sum of the numbers 2020 and 2021. 



Help Polycarp to find out whether the number n can be represented as the sum of a certain number of numbers 2020 and a certain number of numbers 2021.

Input

The first line contains one integer t (1 ≤ t ≤ 10^4) — the number of test cases. Then t test cases follow.

Each test case contains one integer n (1 ≤ n ≤ 10^6) — the number that Polycarp wants to represent as the sum of the numbers 2020 and 2021.

Output

For each test case, output on a separate line: 

  * "YES" if the number n is representable as the sum of a certain number of 2020 and a certain number of 2021; 
  * "NO" otherwise. 



You can output "YES" and "NO" in any case (for example, the strings yEs, yes, Yes and YES will be recognized as positive).

Example

Input


5
1
4041
4042
8081
8079


Output


NO
YES
YES
YES
NO

import java.io.*;
import java.util.*;

public class test {
   
	public static void main (String[] args) throws Exception {
        
		BufferedReader bf=new BufferedReader(new InputStreamReader(System.in));
        
		int y=Integer.parseInt(bf.readLine());
		for(int h=0;h<y;h++)
		{
		    String[] xl=(bf.readLine()).split(" ");int i=0;
            long q;q=Long.parseLong(xl[0]);
            //q=Integer.parseInt(xl[1]);long v = q+0l;
/*
		    long[] arr=new long[x];
		    String[] l =bf.readLine().split(" ");
		    for(String ty : l) arr[i++]=Long.parseLong(ty);
            long min=1000000000+0l;int u=-1;
            for(int z=0;z<arr.length;z++)
            {
                long val = F(arr[z],q);
                if(min>val)
                {
                    min=val;u=z;
                }
            }
            long s=0l;
            for(int a=0;a<arr.length;a++)
            {
                if(a<u) s+=(arr[a]*(min+1l));
                else s+=(arr[a]*min);
            }
            System.out.println(s);
            */
            long n=q+0l;
            boolean bol=false;long b=2020l;long c=2021l;
            for(int x=0;(n-(b*(x+0l)))>=0;x++)
            {
                if(((n-(b*x))%(c))==0)
                {
                    bol=true;
                    break;
                }
            }
            if(bol) System.out.println("YES");
            else System.out.println("NO");
		    
		}
	}
}


