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
115
116
117
118
119
120
121
122
#include<iostream>
#include<vector>
#include<string>
#include<queue>
#include<algorithm>
using namespace std;

bool fragmented(vector<long long> &v) {
    bool end = false;
    for (int i = 1; i < v.size(); i++) {
        if (v[i - 1] != 0 && v[i] == 0) end = true;
        if (v[i - 1] == 0 && v[i] != 0 && end) return true;
    }
    return false;
}

long long odd_even_difference(vector<long long> &v) {
    long long even = 0, odd = 0;
    for (int i = 0; i < v.size(); i++) {
        if (i % 2 == 0) {
            even += v[i];
        }
        else {
            odd += v[i];
        }
    }
    return odd - even;
}

bool solve_from_beginning(vector<long long> &w, int idx) {
    while (true) {
        if (w.size() - idx == 1) {
            return true;
        }
        if (w[idx] > w[idx + 1]) {
            if (w.size() - idx > 2) {
                return false;
            }
            else {
                return true;
            }
        }
        else {
            w[idx + 1] -= w[idx];
            w[idx + 1] += 1;
            idx++;
        }
    }
}

bool solve(vector<long long> &v) {
    if (fragmented(v)) {
        return false;
    }
    else {
        vector<long long> w;
        w.reserve(v.size());
        for (int i = 0; i < v.size(); i++) {
            if (v[i] != 0) {
                w.push_back(v[i]);
            }
        }
        long long diff = odd_even_difference(w);
        if (abs(diff) > 1) {
            return false;
        }

        if (w.size() <= 2) {
            return true;
        }
        else {
            int idx = 0;
            if (diff > 0) {
                w[idx + 1] -= w[idx];
                idx++;
                if (w[idx] <= 0) {
                    return false;
                }
                return solve_from_beginning(w, idx);
            }
            else if (diff < 0) {
                return solve_from_beginning(w, idx);
            }
            else {
                vector<long long> w2(w.begin(), w.end());
                bool res = solve_from_beginning(w2, idx);
                if (res) {
                    return res;
                }
                w[idx + 1] -= w[idx];
                idx++;
                if (w[idx] <= 0) {
                    return false;
                }
                return solve_from_beginning(w, idx);
            }
        }
    }
}

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);

    int t;
    cin >> t;

    while (t--) {
        int n;
        cin >> n;

        vector<long long> v(n);
        for (int i = 0; i < n; i++) {
            cin >> v[i];
        }
        
        bool res = solve(v);
        cout << (res ? "TAK" : "NIE") << "\n";
    }

    return 0;
}