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.*;
import static java.lang.Math.*;

public class B {
    static class FastScanner {
        private BufferedReader reader;
        private StringTokenizer tokenizer;
        private InputStream inputStream = System.in;

        public FastScanner() {
            reader = new BufferedReader(new InputStreamReader(inputStream));
            tokenizer = null;
        }

        public FastScanner(String inputFilePath) {
            if(inputFilePath != null) {
                try {
                    inputStream = new FileInputStream(new File(inputFilePath));
                } catch (FileNotFoundException e) {
                    throw new RuntimeException(e);
                }
            }
            reader = new BufferedReader(new InputStreamReader(inputStream));
            tokenizer = null;
        }
        public String next() {
            while(tokenizer == null || !tokenizer.hasMoreTokens()) {
                try {
                    tokenizer = new StringTokenizer(reader.readLine());
                } catch (IOException e) {
                    throw new RuntimeException(e);
                }
            }
            return tokenizer.nextToken();
        }
        public int nextInt() {
            return Integer.parseInt(next());
        }
        public long nextLong() {
            return Long.parseLong(next());
        }
        public double nextDouble() {
            return Double.parseDouble(next());
        }
        public String nextLine() {
            try {
                return reader.readLine();
            } catch (IOException e) {
                throw new RuntimeException(e);
            }
        }
    }


//    static String inputFilePath = "src/input.txt";
    static String inputFilePath = null;
    static FastScanner scan = new FastScanner(inputFilePath);

    static void sol() {
        int n = scan.nextInt();
        int cnt = n / 2020;
        int _x = n % 2020;
        System.out.println(cnt >= _x ? "YES" : "NO");
    }
    public static void main(String[] args) {
        int T = scan.nextInt();
        while(T -- > 0) sol();
    }

}
