#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] - tr[dr];
        if (sMod10 < 0)
            sMod10 += 10;

        tr[st] = sum[st] - sMod10;
        if (tr[st] < 0)
            tr[st] += 10;

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

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

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

        if (st == 1 && x[st] == 0)
            return false;
        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;
}

bool solveTest() {
    memset(tr, 0, (sumSz + 1) * sizeof(int));
    if (Solve())
        return true;

    //Edge case
    if (sumSz == 1)
        return false;

    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())
        return true;
    else
        return false;
}

int inv(int n) {
    int ans = 0;
    while (n) {
        ans *= 10;
        ans += n % 10;
        n /= 10;
    }
    return ans;
}

/*bool works[1000005];

void computeWorks() {
    for (int i = 0; i <= 1000000; ++ i) {
        int sum = i + inv(i);
        if (sum <= 1000000)
            works[sum] = true;
    }
}

void load(int nr) {
    sumSz = 0;
    while (nr) {
        sum[++ sumSz] = nr % 10;
        nr /= 10;
    }

    reverse(sum + 1, sum + sumSz + 1);
}

void Stress() {
    computeWorks();
    for (int i = 1; i <= 1000000; ++ i) {
        load(i);
        int st = solveTest();
        if (works[i] != st)
            cout << "OOPS " << i << ' ' << works[i] << ' ' << st << endl;
    }
}*/

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';

        if (solveTest())
            cout << "DA\n";
        else
            cout << "NU\n";
    }

    //Stress();

    return 0;
}