#include<stdio.h>
#include<algorithm>
using namespace std;

int n,T,t,i,v[50111];

int main(){

FILE *f=fopen("nivele.in","r");
FILE *g=fopen("nivele.out","w");
fscanf(f,"%d",&T);

  for(t=1;t<=T;t++){
  fscanf(f,"%d",&n);
  v[0]=0;

    for(i=1;i<=n;i++){
    fscanf(f,"%d",&v[++v[0]]);
       while(v[v[0]] == v[v[0]-1] && v[0] > 1){
       v[0]--;
       v[v[0]]--;
       }
    }

  if(v[0] == 1 && v[1] == 1) fprintf(g,"DA\n");
  else       fprintf(g,"NU\n");

  }

fclose(f);
fclose(g);

return 0;
}