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
 98
 99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
#include <bits/stdc++.h>
using namespace std;

constexpr int MAX_N = 1e6;

int t, n;
int a[MAX_N + 1];

bool check(vector<int> vec, bool first_check = true) {
    for(int i : vec) {
        if(i == 0) {
            return false;
        }
    }

    vector<int> vec_cpy = vec;

    for(int i = 0; i < (int)vec.size() - 1; i++) {
        if(vec[i] < vec[i + 1]) {
            vec[i + 1] -= (vec[i] - 1);
            vec[i] = 0;
        }
        else if(vec[i] == vec[i + 1]) {
            vec[i] = vec[i + 1] = 0;
            i++;
        }
        else {
            if(vec[i] - vec[i + 1] == 1) {
                if(i + 2 < (int)vec.size()) {
                    if(!first_check) {
                        return false;
                    }

                    for(int j = 1; j <= i; j++) {
                        vec_cpy[j]--;
                    }

                    return check(vec_cpy, false);
                }
                else {
                    vec[i] = vec[i + 1] = 0;
                }
            }
            else if(vec[i] - vec[i + 1] == 2) {
                if(!first_check) {
                    return false;
                }

                for(int j = 1; j <= i; j++) {
                    vec_cpy[j]--;
                }

                return check(vec_cpy, false);
            }
            else {
                return false;
            }
        }
    }

    if(vec.size() == 2 && vec.back() > 2) {
        return false;
    }

    if(vec.size() > 2 && vec.back() > 1) {
        return false;
    }

    return true;
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);

    cin >> t;

    while(t--) {
        cin >> n;
        
        for(int i = 1; i <= n; i++) {
            cin >> a[i];
        }
        
        int first = 1;
        while(a[first] == 0) {
            first++;
        }
        
        int last = n;
        while(a[last] == 0) {
            last--;
        }
        
        if(first == last) {
            cout << (a[first] == 1 ? "TAK\n" : "NIE\n");
            continue;
        }

        vector<int> vec;

        for(int i = first; i <= last; i++) {
            vec.push_back(a[i]);
        }

        vector<int> vec_rev = vec;
        reverse(vec_rev.begin(), vec_rev.end());

        bool ans = check(vec) || check(vec_rev);
        
        cout << (ans ? "TAK\n" : "NIE\n");
    }
}