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
#include<bits/stdc++.h>
using namespace std;
#define ll long long

bool check(vector<ll> a, int start, int end){
    if(start > end) return 0;
    int n = a.size();
    vector<ll> b(n);
    b[0] = a[0];
    for(int i=1; i<n; i++){
        b[i] = a[i] - b[i-1];
    }
    for(int i = start+1; i<n; i+=2) b[i]++;
    for(int i = end; i<n; i+=2) b[i]--;
    for(int i=0; i<n-1; i++){
        if(b[i]<=0) return 0;
    }
    if(b[n-1]==0) return 1;
    return 0;
}
void solve(){
    int n;
    cin >> n;
    vector<ll> a(n);
    int l=-1, r=0;
    for(int i=0; i<n; i++){
        cin >> a[i];
        if(a[i]>0){
            if(l<0) l = i;
            r = i; 
        }
    }
    vector<ll> v;
    for(int i=l; i<=r; i++){
        if(a[i]==0){
            cout << "NIE\n";
            return;
        }
        v.push_back(a[i]);
    }
    n = v.size();
    for(int i=0; i<2; i++){
        for(int j = n-2; j<n; j++){
            if(check(v, i, j)){
                cout << "TAK\n";
                return;
            }
        }
    }

    cout << "NIE\n";
}

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