#include <fstream>
#include <vector>
#include <bitset>
#include <queue>
#include <algorithm>
#include <utility>
#include <cstring>
#include <string>
#include <stack>
#include <deque>
#include <iomanip>
#include <set>
#include <map>
#include <cassert>
#include <ctime>
#include <list>
#include <iomanip>

using namespace std;

string file = "nivele";

ifstream cin( (file + ".in").c_str() );
ofstream cout( (file + ".out").c_str() );

const int MAXN = 100005;
const int oo = (1<<31)-1;

typedef vector<int> Graph[MAXN];
typedef vector<int> :: iterator It;

const inline int min(const int &a, const int &b) { if( a > b ) return b;   return a; }
const inline int max(const int &a, const int &b) { if( a < b ) return b;   return a; }
const inline void Get_min(int &a, const int b)    { if( a > b ) a = b; }
const inline void Get_max(int &a, const int b)    { if( a < b ) a = b; }

struct ClassComp {
    inline bool operator () (const int &a, const int &b) const {
        return a > b;
    }
};

int main() {
    int N;
    for(cin >> N ; N ; -- N) {
        int x, Deep;
        stack<int> Stack;
        for(cin >> x ; x ; -- x) {
            cin >> Deep;
            while(!Stack.empty() && Stack.top() == Deep) {
                Stack.pop();
                --Deep;
            }
            Stack.push(Deep);
        }
        if(Stack.size() == 1 && Stack.top() == 1)
            cout << "DA\n";
        else cout << "NU\n";

    }
    cin.close();
    cout.close();
    return 0;
}