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

void solve() {
    int n; cin >> n;
    vector<int> a(n);
    for (int i = 0; i < n; i++) cin >> a[i];
    while (a.back() == 0) a.pop_back();
    reverse(a.begin(), a.end());
    while (a.back() == 0) a.pop_back();
    while (a.size() >= 2 && a[a.size()-2]-a.back() > 0) {
        a[a.size()-2]-=a.back();
        a.pop_back();
    }
    reverse(a.begin(), a.end());
    while (a.size() >= 2 && a[a.size()-2]-a.back() > 0) {
        a[a.size()-2]-=a.back();
        a.pop_back();
    }
    if (a.size() == 1) {
        if (a[0] == 1) {
            cout << "TAK\n";
            return;
        }
        else {
            cout << "NIE\n";
            return;
        }
    }
    if (a.size() == 2) {
        cout << "TAK\n";
        return;
    }
    for (int i = 1; i < a.size()-1; i++) a[i]++;
    while (a.size() >= 2 && a[a.size()-2]-a.back() > 0) {
        a[a.size()-2]-=a.back();
        a.pop_back();
    }
    reverse(a.begin(), a.end());
    while (a.size() >= 2 && a[a.size()-2]-a.back() > 0) {
        a[a.size()-2]-=a.back();
        a.pop_back();
    }
    if (a.size() == 2) {
        cout << "TAK\n";
        return;
    }
    cout << "NIE\n";
    return;
}

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