#include <bits/stdc++.h>

using namespace std;

#define ll long long 
#define ld long double

int A[1000000 + 10];
int R[1000000 + 10];

bool check(int n) {
    for (int i = 0; i <= n; i++) R[i] = 0;
    
    int i = 1, j = n;
    while (A[i] == 0) i++;
    while (A[j] == 0) j--;

    if (i == j) {
        if (A[i] == 1) return true;
        else return false;
    }

    for (int k = i; k <= j; k++) {
        if (A[k] == 0) return false;
    }

    for (; i < j; i++) {
        R[i] = A[i] - R[i - 1];
        if (R[i] <= 0 && i < j - 1) {
            return false;
        }
    }
    if (abs(R[j - 1] - A[j]) > 1) return false;
    else return true;
}

void solve() {
    int n;
    cin >> n;
    for (int i = 1; i <= n; i++) cin >> A[i];

    if (check(n)) cout << "TAK\n";
    else {
        reverse(A + 1, A + n + 1);
        if (!check(n)) cout << "NIE\n";
        else cout << "TAK\n";
    }

}

int main () {
    ios_base::sync_with_stdio(NULL);
    cin.tie(0);

    int t;
    cin >> t;
    while (t--) solve();

    return 0;
}