1 #include<cstdio>
2 #include<cstdlib>
3 #include<cmath>
4 #include<cstring>
5 #include<algorithm>
6 #include<iostream>
7 #include<vector>
8 #include<map>
9 #include<set>
10 #include<queue>
11 #include<string>
12 #define inf 1000000000
13 #define maxn 1000000+5
14 #define maxm 500+100
15 #define eps 1e-10
16 #define ll long long
17 #define pa pair<int,int>
18 #define for0(i,n) for(int i=0;i<=(n);i++)
19 #define for1(i,n) for(int i=1;i<=(n);i++)
20 #define for2(i,x,y) for(int i=(x);i<=(y);i++)
21 #define for3(i,x,y) for(int i=(x);i>=(y);i--)
22 #define mod 1000000007
23 using namespace std;
24 inline int read()
25 {
26 int x=0,f=1;char ch=getchar();
27 while(ch<‘0‘||ch>‘9‘){if(ch==‘-‘)f=-1;ch=getchar();}
28 while(ch>=‘0‘&&ch<=‘9‘){x=10*x+ch-‘0‘;ch=getchar();}
29 return x*f;
30 }
31 bool f[maxn];
32 int main()
33 {
34 freopen("input.txt","r",stdin);
35 freopen("output.txt","w",stdout);
36 f[0]=0;
37 for1(i,maxn)
38 {
39 int x=i,t,mi=10,mx=0;
40 while(x){t=x%10;mx=max(mx,t);if(t)mi=min(mi,t);x/=10;}
41 if(!f[i-mi]||!f[i-mx])f[i]=1;
42 }
43 int cs=read();
44 while(cs--)
45 if(f[read()])printf("YES\n");else printf("NO\n");
46 return 0;
47 }