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
#define NDEBUG 1
#include <bits/stdc++.h>
using namespace std;
#define V vector
#define Q queue
#define PQ priority_queue
#define ST stack
#define UMAP unordered_map
typedef long long LL;
typedef pair<int, int> PII;
typedef V<int> VI;
typedef V<V<int>> VVI;
typedef V<LL> VLL;

bool check(VI& val) {
    int m = val.size();
    --val[0];
    bool start = false;
    for (int i = 0; i < m-1; ++i) {
        if (val[i] > val[i+1])
            return false;
        if (val[i] == val[i+1] && i != m-2)
            return false;
        int minim = min(val[i], val[i+1]);
        val[i] -= minim;
        val[i+1] -= minim;
        --val[i+1];
        if (val[i+1] > 0 && !start)
            --val[i+1];
        else
            start = true;
    }

    for (int i = 0; i < m-1; ++i)
        if (val[i] != 0)
            return false;
    
    if (val[m-1] != 0 && val[m-1] != -1)
        return false;

    return true;
}

void solve() {
    int n;
    cin >> n;
    VI inp(n);
    for (int i = 0; i < n; ++i)
        cin >> inp[i];
    VI v, u;
    bool not_zero = false;
    bool zero_again = false;
    for (int i = 0; i < n; ++i) {
        if (inp[i] != 0) {
            not_zero = true;
            v.push_back(inp[i]);
        }
        if (inp[i] == 0 && not_zero)
            zero_again = true;
        if (inp[i] != 0 && zero_again) {
            cout << "NIE\n";
            return;
        }
    }
    
    u.resize(v.size());
    reverse_copy(v.begin(), v.end(), u.begin());

    bool res = check(v) || check(u);
    if (res) {
        cout << "TAK\n";
    } else {
        cout << "NIE\n";
    }
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);
    int T = 1;
    cin >> T;
    while (T--) solve();

    return 0;
}