var fi,fo:text;
    T,n,i,j,k:longint;
    a:array[1..50001]of longint;
function max:longint;
var i,maxim,poz:longint;
begin
  maxim:=0;
  for i:=1 to n do
    if maxim<a[i] then
      begin
        maxim:=a[i];
        poz:=i;
      end;
  max:=poz;
end;
procedure solve;
begin
  k:=1;
  while a[k]<>1 do
    begin
      k:=max;
      if a[k]=a[k+1] then
        begin
          a[k]:=a[k]-1;
          a[k+1]:=0;
         end
      else
        begin
          writeln(fo,'NU');
          exit;
        end;
    end;
   writeln(fo,'DA');
end;
begin
  assign(fi,'nivele.in'); reset(fi);
  assign(fo,'nivele.out'); rewrite(fo);
  read(fi,T);
  for i:=1 to T do
    begin
      read(fi,n);
      for j:=1 to n do
        read(fi,a[j]);
      solve;
      end;
    close(fi);
    close(fo);
end.