CF1475B.New Year's Number

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$.

Polycarp 回忆起了 2020 年，并为迎来崭新的 2021 年而欣喜不已。为了铭记这一美好时刻，Polycarp 希望将数字 $n$ 表示为若干个 $2020$ 与若干个 $2021$ 的和。

例如，若：

• $n=4041$，则该数 $n$ 可表示为 $2020 + 2021$ 的和；
• $n=4042$，则该数 $n$ 可表示为 $2021 + 2021$ 的和；
• $n=8081$，则该数 $n$ 可表示为 $2020 + 2020 + 2020 + 2021$ 的和；
• $n=8079$，则该数 $n$ 无法表示为若干个 $2020$ 与若干个 $2021$ 的和。

请帮助 Polycarp 判断：数字 $n$ 是否能表示为若干个 $2020$ 与若干个 $2021$ 的和。

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

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

第一行包含一个整数 $t$（$1 \leq t \leq 10^4$）—— 测试用例的数量。接下来是 $t$ 个测试用例。

每个测试用例包含一个整数 $n$（$1 \leq n \leq 10^6$）—— Polycarp 想将其表示为若干个 $2020$ 和 $2021$ 的和。

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).

对于每个测试用例，在单独的一行上输出：

• 如果数字 $n$ 可以表示为若干个 $2020$ 与若干个 $2021$ 的和，则输出 "YES"；
• 否则输出 "NO"。

你可以以任意大小写形式输出 "YES" 和 "NO"（例如，字符串 yEs、yes、Yes 和 YES 均会被识别为肯定回答）。