#include <fstream>
#include <stack>
#define nmax 50100
using namespace std;

int T,N,Solution,A[nmax];

void solve() {

    int i;
    stack <int> St;

    for(i=1;i<=N;i++) {

        while(!St.empty() && St.top()==A[i]) {
            A[i]--;
            St.pop();
            }

        St.push(A[i]);

        }

    Solution=St.size()&(St.top()==1);

}
void read(ifstream & in) {

    in>>N;

    for(int i=1;i<=N;i++)
        in>>A[i];

}
int main() {

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

    in>>T;
    while(T--) {

        read(in);
        solve();

        if(Solution)
            out<<"DA\n";
        else
            out<<"NU\n";

        }

    in.close();
    out.close();

    return 0;

}