#include <fstream>
#include <algorithm>

using namespace std;

ifstream fin ("nivele.in");
ofstream fout("nivele.out");

int n, j, i, t, poz, u, s[50003], x, ok;

int main()
{
    fin>>t;
    for(j=1;j<=t;j++){
        fin>>n;
        fin>>x;
        s[1]=x;
        u=1;
        for(i=2;i<=n;i++){
            fin>>x;
            s[++u]=x;
            while(s[u]==s[u-1] && u>=2){
                u--;
                s[u]=s[u]-1;
            }
        }
        if(u==1)
            fout<<"DA\n";
        else
            fout<<"NU\n";
    }

    return 0;
}