#include <iostream>
#include <vector>
#include <queue>

struct State {
    int pos;                     // Pozycja zabawki
    std::vector<int> visitCount;  // Liczba odwiedzin każdej zabawki

    State(int p, const std::vector<int>& vc) : pos(p), visitCount(vc) {}
};

int main() {
    std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr);

    int t;
    std::cin >> t;

    while (t--) {
        int n;
        std::cin >> n;
        std::vector<int> toys(n);

        for (int &toy : toys) {
            std::cin >> toy;
        }

        std::queue<State> q;

        for (int i = 0; i < n; i++) {
            if (toys[i] > 0) {
                std::vector<int> visited(n, 0);
                visited[i] = 1;
                q.emplace(i, visited);
            }
        }

        bool found = false;
        while (!q.empty()) {
            State current = q.front();
            q.pop();

            int pos = current.pos;

            bool valid = true;
            for (int j = 0; j < n; j++) {
                if (current.visitCount[j] != toys[j]) {
                    valid = false;
                    break;
                }
            }

            if (valid) {
                std::cout << "TAK\n";
                found = true;
                break;
            }

            if (pos + 1 < n) {
                State nextState = current;
                nextState.pos = pos + 1;
                nextState.visitCount[pos + 1]++;

                if (nextState.visitCount[pos + 1] <= toys[pos + 1]) {
                    q.push(nextState);
                }
            }

            if (pos - 1 >= 0) {
                State prevState = current;
                prevState.pos = pos - 1;
                prevState.visitCount[pos - 1]++;

                if (prevState.visitCount[pos - 1] <= toys[pos - 1]) {
                    q.push(prevState);
                }
            }
        }

        if (!found) {
            std::cout << "NIE\n";
        }
    }

    return 0;
}