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
#include<bits/stdc++.h>
#define st first
#define nd second
#define all(x) x.begin(), x.end()
#define BOOST cin.tie(NULL); ios_base::sync_with_stdio(false);
 
// #define int ll
typedef long long ll;

using namespace std;
template <typename T> struct tag:reference_wrapper <T>{ using reference_wrapper <T>::reference_wrapper; };
template <typename T1, typename T2> static inline tag <ostream> operator<<(tag <ostream> os, pair<T1, T2> const& p){ return os.get()<<"{"<<p.first<<", "<<p.second<<"}", os;}
template <typename Other> static inline tag <ostream> operator<<(tag <ostream> os, Other const& o){ os.get()<<o; return os; }
template <typename T> static inline tag <ostream> operator <<(tag <ostream> os, vector <T> const& v){ os.get()<<"["; for (int i=0; i<v.size(); i++) if (i!=v.size()-1) os.get()<<v[i]<<", "; else os.get()<<v[i]; return os.get()<<"]", os; }
template <typename T> static inline tag <ostream> operator <<(tag <ostream> os, set <T> const& s){ vector <T> v; for (auto i: s) v.push_back(i); os.get()<<"["; for (int i=0; i<v.size(); i++) if (i!=v.size()-1) os.get()<<v[i]<<", "; else os.get()<<v[i]; return os.get()<<"]", os; }

void solve(){
    int n; cin >> n;
    vector<int> ai(n + 1, 0);
    for(int i = 0; i < n; i++){
        cin >> ai[i];
    }
    int zero = n;
    int ptr = 0;
    int flag = 0;
    int flag2 = 0;
    while(ai[zero - 1] == 0) zero--;
    for(int i = 0; i < zero; i++){
        if(i > ptr && flag){
            break;
        }
        if(ai[i] != 0){
            flag = 1;
        } else {
            if(!flag){
                ptr++;
            }
        }
        if(ai[i] > ai[i + 1]){
            if(ai[i] - 1 == ai[i + 1] && zero <= i + 2 && ptr == i){
                cout << "TAK\n";
                return;
            } else {
                cout << "NIE\n";
                return;
            }
        }
        if(ai[i] == ai[i + 1] && ai[i] != 0){
            if(flag2 == 0){
                ai[i + 1] -= ai[i];
                flag2 = 1;
                ptr = i + 1 + flag2;
            } else {
                if(ptr == i){
                    ai[i + 1] -= ai[i];
                    ptr = i + 2;
                } else {
                    ai[i + 1] -= ai[i];
                    ptr = i;
                }
            }
            ai[i] = 0;
        }
        if(ai[i] < ai[i + 1] && ai[i] != 0){
            if(flag2 == 0){
                ai[i + 1] -= ai[i];
                ptr = i + 1;
            } else {
                if(ptr == i){
                    ai[i + 1] -= ai[i];
                    ptr = i + 2;
                } else {
                    ai[i + 1] -= ai[i] + 1;
                    ptr = i + 2;
                }   
            }
            ai[i] = 0;
        }
    }
    if(ai[zero - 1] == 0){
        cout << "TAK\n";
    } else {
        cout << "NIE\n";
    }
}


int32_t main(){
    BOOST;
    
    int q; cin >> q;
    while(q--){
        solve();
    }

    return 0;
}