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
#include<bits/stdc++.h>
#define X first
#define Y second
#define eb emplace_back
#define pb push_back
#define print1d(x) for(auto i : x){ cout << i << " ";} cout << '\n'
#define print2d(x) for(auto u : x){ print1d(u);} cout << "------" << '\n'
#define CLR(x, y) memset(x, y, sizeof(x))
#define ALL(X) X.begin(), X.end()
#define io_o() ios_base::sync_with_stdio(false); cin.tie(0);cout.tie(0)
#define mp(x, y) make_pair(x, y)
#define mpp(w, x, y, z) make_pair(mp(w, x), mp(y, z))
#define For(i, n) for(int i = 0; i < n; i++)
#define For1(i, n, m) for(int i = n; i < m; i++)
#define For2(X) for(auto x : X)
#define maxn 100005
#define mod (1e9)+7
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
//priority_queue<ll> pq; priority_queue<pii,vector<pii>, greater<pii>> pq;
//sort(a, a+n, greater<int>());

int main(){
	io_o(); //cute!
	int t; cin >> t;
	while(t--){
		int n; cin >> n;
		int a = n / 2020;
		int b = n % 2020;
		if(b <= a) cout << "YES\n";
		else cout << "NO\n";
	}
	return 0;
}
