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
#include <bits/stdc++.h>
using namespace std;
#define fwd(i, a, n) for (int i = (a); i < (n); i++)
#define rep(i, n) fwd(i, 0, n)
#define all(X) X.begin(), X.end()
#define sz(X) int(size(X))
#define pb push_back
#define eb emplace_back
#define st first
#define nd second
using pii = pair<int, int>; using vi = vector<int>;
using ll = long long; using ld = long double;
#ifdef LOC
auto SS = signal(6, [](int) { *(int *)0 = 0; });
#define DTP(x, y) auto operator << (auto &o, auto a) -> decltype(y, o) { o << "("; x; return o << ")"; }
DTP(o << a.st << ", " << a.nd, a.nd);
DTP(for (auto i : a) o << i << ", ", all(a));
void dump(auto... x) { (( cerr << x << ", " ), ...) <<
'\n'; }
#define deb(x...) cerr << setw(4) << __LINE__ << ":[" #x "]: ", dump(x)
#else
#define deb(...) 0
#endif
 
bool solve(){
    int n; cin >> n;
    vector<int> v(n + 1, 0);
    rep(i, n)cin>>v[i];
    int a = 0;
    while(v[a] == 0 && a < n)a++;
    if(a == n)return true;
    auto zeros = [&](int i){
        if(i >= n)return true;
        for(int j = i; j < n; j++){
            if(v[j] != 0)return false;
        }
        return true;
    };
    auto finish = [&](int pos){
        if(pos >= n)return true;
        if(v[pos] == 0)return zeros(pos);
        for(int i = pos; i < n; i++){
            if(v[i] > v[i+1] + 1){
                return false;
            }else if(v[i] == v[i+1] + 1){
                return zeros(i+2);
            }else{
                v[i+1] -= (v[i] - 1);
                v[i] = 0;
            }
        }
        return true;
    };
    for(; a < n; a++){
        if(v[a] < v[a+1]){
            v[a+1] -= v[a];
            v[a] = 0;
        }else if(v[a] == v[a+1]){
            return finish(a+2);
        }else if(v[a] == v[a+1] + 1){
            return zeros(a+2);
        }else{
            return false;
        }
    }
    return true;
}

int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    int t; cin >> t;
    while(t--){
        bool res = solve();
        if(res){
            cout << "TAK\n";
        }else{
            cout << "NIE\n";
        }
    }
    return 0;
}