#include<cstdio>
#include<cstring>
int n,t,i;
char a[10001];
int b[10001];
int solve(int st,int dr)
{
	int j;
	if(st>dr) return 0;
	while(st!=dr && st+1!=dr){	 
		if(b[st]>19) return 0;
		if(b[st]==b[dr]) st++,dr--;
		else
			if(b[st]-1==b[dr]){st++;dr--;b[st]+=10;}
			else
				if(b[st]<19 && b[st]-10==b[dr]){
					st++;dr--;b[dr]--;
					j=dr;
					while(j>st && b[j]<0){
						b[j]=9;
						b[j-1]--;
						j--;}
					if(j==st && b[st]<0) return 0;}
				else
					if(b[st]-11==b[dr]){
						st++;dr--;b[dr]--;b[st]+=10;
						j=dr;
						while(j>st && b[j]<0){
							b[j]=9;
							b[j-1]--;
							j--;}
						if(j==st && b[st]<0) return 0;}
					else
						return 0;
	}
	if(b[st]>19) return 0;
	if(st==dr) return (b[st]+1)%2;
	if(b[st]==b[dr]) return 1;
	else
		if(b[st]-11==b[dr]) return 1;
		else return 0;
}
int main()
{
	freopen("invers.in","r",stdin);
	freopen("invers.out","w",stdout);
	scanf("%d ",&t);
	for(;t;t--){
		scanf(" %s ",a);
		n=strlen(a);
		for(i=0;i<n;i++){a[i]-='0';b[i]=a[i];}
		if(solve(0,n-1)) 
			goto da;
		else
			if(a[0]==1){
				for(i=0;i<n;i++)
					b[i]=a[i];
				b[1]+=10;
				if(solve(1,n-1)) 
					goto da;
				else
					goto nu;
			}
			else
				goto nu;
da:
		printf("DA\n");
		continue;
nu:
		printf("NU\n");
	}
	fclose(stdout);
	return 0;
}