#include <iostream>
#include <fstream>
using namespace std;
int main() 
{
	ifstream f("invers.in");
	ofstream g("invers.out");
	short int v[10000],ok;
	int p=1,n,i,k;
	char c;
	f>>n;
	for (i=1; i<=n;i++)
		{
			ok=1;
			f>>c;
			while(c!='\n')
			{
				v[p++]=c-'0';
				f.get(c);
			}
		p--;
		if (p==1)
		{
			if(v[1]%2==0)
				g<<"DA"<<"\n"; else
				g<<"NU"<<"\n";	} else
		if (p%2==0)
			{
				for (k=1;k<=p/2;k++)
					if (v[k]!=v[p-k+1])
						{
							ok=0; break;
						}
					if(ok)
						g<<"DA"<<"\n"; else
						g<<"NU"<<"\n";
			} else
			{
				for (k=1;k<=p/2;k++)
					if (v[k]!=v[p-k+1])
						{
							ok=0; break;
						}
					if(ok)
						g<<"DA"<<"\n"; else
						g<<"NU"<<"\n";
			}	
			p=1;
		}
	g.close();
	return 0;
}