#include <cstdio>

using namespace std;

int n, T;
int Stack[50007];

int main() {
    freopen("nivele.in", "r", stdin);
    freopen("nivele.out", "w", stdout);
    scanf("%d", &T);
    while(T){
        --T;
        scanf("%d", &n);
        Stack[0] = 0;
        for(int i = 1; i <= n; ++i){
            ++Stack[0];
            scanf("%d", &Stack[Stack[0]]);
            while(Stack[0] > 1 && Stack[Stack[0]] == Stack[Stack[0] - 1]) {
                --Stack[0];
                --Stack[Stack[0]];
            }
        }
        if(Stack[0] == 1 && Stack[1] == 1)
            printf("DA\n");
        else
            printf("NU\n");
    }
    return 0;
}