#include <iostream>
#include <algorithm>
#include <cstring>

using namespace std;

const int NMAX = 10000 + 5;

int x[NMAX];

int sumSz;
char chSum[NMAX];
int sum[NMAX];
int tr[NMAX];

bool Solve() {
    int st = 1;
    int dr = sumSz;

    while (st <= dr) {
        int sMod10 = (sum[dr] + 10 - tr[dr]) % 10;
        tr[st] = (sum[st] + 10 - sMod10) % 10;

        int s = sum[st] + 10 * tr[st - 1] - tr[st];
        if (st == dr - 1 && s / 10 != tr[st])
            return false;

        tr[dr - 1] = (s + tr[dr]) / 10;

        x[st] = s / 2;
        x[dr] = s - s / 2;

        if (x[st] < 0 || x[st] > 9 || x[dr] < 0 || x[dr] > 9)
            return false;
        if (st == dr && s & 1)
            return false;

        ++ st;
        -- dr;
    }

    /*for (int i = 1; i <= sumSz; ++ i)
        cout << x[i] << ' ';
    cout << endl;*/

    return true;
}

int main()
{
    freopen("invers.in", "r", stdin);
    freopen("invers.out", "w", stdout);

    int t = 0;
    cin >> t; cin.ignore();

    while (t --) {
        cin.get(chSum + 1, NMAX); cin.get();
        sumSz = strlen(chSum + 1);

        for (int i = 1; i <= sumSz; ++ i)
            sum[i] = chSum[i] - '0';

        memset(tr, 0, (sumSz + 1) * sizeof(int));
        if (Solve()) {
            cout << "DA\n";
            continue;
        }

        //Edge case
        if (sumSz == 1) {
            cout << "NU\n";
            continue;
        }

        for (int i = 0; i < sumSz; ++ i)
            sum[i] = sum[i + 1];
        -- sumSz;

        memset(tr, 0, (sumSz + 1) * sizeof(int));
        tr[0] = sum[0];
        if (Solve())
            cout << "DA\n";
        else
            cout << "NU\n";
    }

    return 0;
}