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
/**
 * This is boilerplate code used to generate a Java file
 */
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;

public class Solution {
  public static void main(String[] args) throws IOException {
    BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
    int t = toInt(br.readLine());
    while (t-- > 0) {
      int num = toInt(br.readLine());
      int iters = (int) Math.ceil(num / 2020.0), rem = num % 2020;
      System.out.println(rem >= iters ? "NO" : "YES");
    }

    br.close();
  }

  public static int[] toIntArr(String[] nums) {
    int[] arr = new int[nums.length];
    for (int i = 0; i < nums.length; i++) {
      try {
        arr[i] = toInt(nums[i]);
      } catch (Exception e) { }
    }
    return arr;
  }

  public static long[] toLongArr(String[] nums) {
    long[] arr = new long[nums.length];
    for (int i = 0; i < nums.length; i++) {
      try {
        arr[i] = toLong(nums[i]);
      } catch (Exception e) { }
    }
    return arr;
  }

  public static int toInt(String num) {
    return Integer.parseInt(num);
  }

  public static long toLong(String num) {
    return Long.parseLong(num);
  }
}
