I Hate 1111 (1400分)codeforces

You are given an integer x�. Can you make x� by summing up some number of 11,111,1111,11111,…11,111,1111,11111,…? (You can use any number among them any number of times).

For instance,

• 33=11+11+1133=11+11+11
• 144=111+11+11+11144=111+11+11+11

Input

The first line of input contains a single integer t� (1≤t≤10000)(1≤�≤10000) — the number of testcases.

The first and only line of each testcase contains a single integer x� (1≤x≤109)(1≤�≤109) — the number you have to make.

Output

For each testcase, you should output a single string. If you can make x�, output "YES" (without quotes). Otherwise, output "NO".

You can print each letter of "YES" and "NO" in any case (upper or lower).

Example

input

Copy

3
33
144
69

output

Copy

YES
YES
NO

Note

Ways to make 3333 and 144144 were presented in the statement. It can be proved that we can't present 6969 this way.

#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define int long long
#define PII pair<int,int>
#define IOS ios_base::sync_with_stdio(0);
int n,m,k,t;
map<int,int>ok;
map<int,int>vis;
int dz[8]={11,111,1111,11111,111111,1111111,11111111,111111111};
bool check(int x){
	priority_queue<int,vector<int>,greater<int>> q;
	q.push(x);
	while(!q.empty()){
		int a=q.top();
		q.pop();
		for(int i=7;i>=0;i--){
			if(a<dz[i])continue;
			if(a%dz[i]==0){
				return true;
			}
			int g=a-dz[i];
			if(!vis[g]){
				q.push(g);
				vis[g]++;
			}
		}
	}
	return false;
}
signed main(){
	cin >> t;
	while(t--){
		vis.clear();
		int a;
		cin >> a;
		if(ok[a]==1){
			cout << "YES" << endl;
			continue;
		}else if(ok[a]==-1){
			cout << "NO" << endl;
			continue;
		}
		if(check(a)){
			ok[a]=1;
			cout << "YES" << endl;
		}else{
			ok[a]=-1;
			cout << "NO" << endl;
		}
	}
	return 0; 
}