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>
using namespace std;

#define double long double
#define int long long
#define foin(i, a, b) for (int i=a; i<b; i++)
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define all(v) v.begin(), v.end()
#define allr(v) v.rbegin(),v.rend()
#define Jai_Mahakaal ios_base::sync_with_stdio(false); cin.tie(NULL);

typedef pair<int, int> pii;
typedef pair<string, string> pss;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<pii> vii;

long long infll = LLONG_MAX;
int infi = INT_MAX;
long infl = LONG_MAX;

bool isPrime(int n)
{
	// Corner cases
	if (n <= 1)  return false;
	if (n <= 3)  return true;

	// This is checked so that we can skip
	// middle five numbers in below loop
	if (n % 2 == 0 || n % 3 == 0) return false;

	for (int i = 5; i * i <= n; i = i + 6)
		if (n % i == 0 || n % (i + 2) == 0)
			return false;

	return true;
}

//***************************************Rakt_Charitra*******************************************//

void solve()
{	int t;
	cin >> t;
	while (t--)
	{
		int n;
		cin >> n;
		if (n / 2020 >= n % 2020)
			cout << "YES" << endl;
		else
			cout << "NO" << endl;

	}




}





//***********************************************************************************************//


signed main()
{

	Jai_Mahakaal
#ifndef ONLINE_JUDGE
	// freopen("input.txt", "r", stdin);
	freopen("error.txt", "w", stderr);
	// freopen("output.txt", "w", stdout);
#endif


	solve();
	//cout << "\n";
	cerr << "time taken : " << (float)clock() / CLOCKS_PER_SEC << " secs" << endl;

}