1
  2
  3
  4
  5
  6
  7
  8
  9
 10
 11
 12
 13
 14
 15
 16
 17
 18
 19
 20
 21
 22
 23
 24
 25
 26
 27
 28
 29
 30
 31
 32
 33
 34
 35
 36
 37
 38
 39
 40
 41
 42
 43
 44
 45
 46
 47
 48
 49
 50
 51
 52
 53
 54
 55
 56
 57
 58
 59
 60
 61
 62
 63
 64
 65
 66
 67
 68
 69
 70
 71
 72
 73
 74
 75
 76
 77
 78
 79
 80
 81
 82
 83
 84
 85
 86
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
#include <bits/stdc++.h>

using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define pb push_back
#define st first
#define nd second
const int MAXN = 1e6 + 7;
int T[MAXN];
int B[MAXN];
int pom[MAXN];

void solve() {
    int n;
    cin >> n;
    int l = 0;
    rep(i, n) {
        cin >> T[i];
        if (i == 0) {
            B[i] = T[i];
        }
        else {
            B[i] = T[i] - B[i - 1];
        }
        if (l == i && T[i] == 0) {
            l++;
        }
        pom[i] = T[i];
    }
    int C[n];
    int r = n - 1;
    for (int i = n - 1; i >= 0; i--) {
        if (r == i && T[i] == 0) {
            r--;
        }
        if (i == n - 1) {
            C[i] = T[i];
        }
        else {
            C[i] = T[i] - C[i + 1];
        }
    }
    bool odp = false;
    vector<int> s1;
    if (l == r) {
        s1.pb(l);
    }
    else {
        s1.pb(l);
        s1.pb(l + 1);
        s1.pb(r);
        s1.pb(r - 1);
    }
    for (auto a: s1) {
        for (auto b: s1) {
            if (a > b) {
                continue;
            }
            rep(i, n) {
                T[i] = pom[i];
            }
            bool c = true;
            for (int i = l + 1; i <= a; i++) {
                if (B[i] - 1 < 0) {
                    c = false;
                }
            }
            for (int k = a + 1; k <= b; k++) {
                if ((k - a) % 2 == 1) {
                    if (B[k] < 0) {
                        c = false;
                    }
                }
                else {
                    if (B[k] - 1 < 0) {
                        c = false;
                    }
                }
            }
            for (int k = b + 1; k < r; k++) {
                if (C[k] - 1 < 0) {
                    c = false;
                }
            }
            if (b + 1 <= r) {
                if ((b - a) % 2 == 0) {
                    if (B[b] - 1 < C[b + 1] - 1 || B[b] - 1 > C[b + 1]) {
                        c = false;
                    }
                }
                else {
                    if (B[b] < C[b + 1] - 1 || B[b] > C[b + 1]) {
                        c = false;
                    }
                }
            }
            else {
                if ((b - a) % 2 == 0) {
                    if (B[b] - 1 != 0) {
                        c = false;
                    }
                }
                else {
                    if (B[b] != 0) {
                        c = false;
                    }
                }
            }
            // cout << '\n';
            if (c) {
                // cout << "a = " << a << " b = " << b << '\n';
                odp = true;
            }
        }
    }
    if (odp) {
        cout << "TAK" << '\n';
    }
    else {
        cout << "NIE" << '\n';
    }
}

int main() {
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    int t;
    cin >> t;
    while (t--) {
        solve();
    }   
    return 0;
}