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
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
#include <bits/stdc++.h>
using namespace std;

#ifdef DEBUG
auto &operator<<(auto &o, pair<auto, auto> p) {
    return o << "(" << p.first << ", " << p.second <<")";
}
auto operator<<(auto &o, auto x)-> decltype(x.end(), o) {
    o << "{";int i = 0;
    for(auto e : x) o << ", "+!i++<<e;
    return o <<"}";
}
#define debug(x...) cerr << "["#x"]: ",[](auto...$){((cerr<<$<<"; "),...)<<endl;}(x)
#else
#define debug(...) {}
#endif

#define int long long
#define all(x) x.begin(), x.end()
#define sz(x) (int)(x).size()
#define pb push_back
#define fi first
#define se second
typedef pair <int, int> pii;

constexpr int INF = 1e9 + 177;

void test() {
    debug("TC______________________");
    int n; cin>>n;
    vector <int> v(n);
    
    for (int i=0; i<n; ++i) {
        cin>>v[i];
    }

    int it = 0;
    while (it < n && v[it] == 0) {
        it++;
    }

    int rit = n-1;
    while (rit >= 0 && v[rit] == 0) {
        rit--;
    }

    vector <int> pop;
    bool tb = true;
    for (int i=it; i<=rit; ++i) {
        if (v[i] == 0) tb = false;
        pop.push_back(v[i]);
    }

    v = pop;
    n = sz(v);
    // 0 - nic 1 - byl start 2 - byl koniec 3 - byly oba
    debug(v);

    // lewo ile dal mi poprzedni
    // prawo ile dalem poprzedniemu

    vector <vector <pii> > stan(4);
    stan[0].push_back({0, 0});
    bool ok = false;
    if (!tb) n = 0;

    for (int i=0; i<n; ++i) {
        debug(i, "--------");
        vector<vector <pii> > nstan(4);

        for (auto &[l, r] : stan[0]) {
            int need = v[i] - l;
            int give = v[i] - r;

            // start i koniec na prawo, cos mi musieli dac i ja musze tam wrocic
            // cos biore, zeby przyjsc i cos daje zeby pojsc

            if (need > 0 && give > 0 && i < n-1) {
                nstan[0].push_back({give, need});
            }

            // teraz jest początek
            need--;
            if (i < n-1 && (i == 0 || l) && (i == 0 || r) && (i==0 || l == r) && give > need && need >= 0) {
                nstan[1].push_back({give, need});
            }

            // teraz dodaje koniec
            need++; give--;
            // musialem wziac cos od startu, ale tu jest koniec wiec nie musze dawac naprzod
            if (i < n-1 && (i == 0 || l) && (i == 0 || r) && (i==0 || l == r) && give >= 0 && need > give) {
                nstan[2].push_back({give, need});
            }

            // dodaje i początek i koniec
            need--;
            if (i == n-1 && (give == 0) && (need == 0)) {
                ok = true;
                break;
            } 
            // musialem wrocic z lewej, isc w lewo, przyjsc z prawej i isc w prawo
            else if (i < n-1 && (i == 0 || l) && (i==0 || r) && (i==0 || l == r) && give > 0 && need == give) {
                nstan[3].push_back({give, need});
            }
        }
        
        for (auto &[l, r] : stan[1]) {
            // byl juz poczatek (musial mi cos dac)
            int need = v[i] - l;
            int give = v[i] - r;
            
            if (i < n-1 && (i == 0 || l) && (i==0 || l > r) && give > need && need >= 0) {
                nstan[1].push_back({give, need});
            }
            
            // dodaje koniec
            give--;
            if (i == n-1 && (give == 0) && (need == 0)) {
                ok = true;
                break;
            } // musialem wrocic z lewej, przyjsc z prawej i isc w prawo
            if (i < n-1 && (i == 0 || l) && give > 0 && give == need) {
                nstan[3].push_back({give, need});
            }
        }
            
        for (auto &[l, r] : stan[2]) {
            int need = v[i] - l;
            int give = v[i] - r;

            if (i < n-1 && (i==0 || r) && (i==0 || r > l) && need > give && give >= 0) {
                nstan[2].push_back({give, need});
            }

            need--;
            
            // dodaje poczatek jest poczatek i koniec
            if (i == n-1 && (give == 0) && (need == 0)) {
                ok = true;
                break;
            } // musialem wrocic z lewej, isc w lewo, przyjsc z prawej i isc w prawo
            if (i < n-1 && (i==0 || r) && give > 0 && need == give) {
                nstan[3].push_back({give, need});
            }
        }   

        for (auto &[l, r] : stan[3]) {
            if (l > 0 && r > 0) {
                int need = v[i] - l;
                int give = v[i] - r;
                
                if (i == n-1 && (give == 0) && (need == 0)) {
                    ok = true;
                    break;
                }
                if (i < n-1 && need > 0 && give == need) {
                    nstan[3].push_back({give, need});
                }
            }
        }

        stan = nstan;
        for (int j=0; j<4; ++j) {
            sort(all(stan[j]));
            stan[j].erase(unique(all(stan[j])), stan[j].end());
        }
    }

    if (ok && tb) {
        cout<<"TAK\n";
    }
    else {
        cout<<"NIE\n";
    }
}

signed main() {
  ios_base::sync_with_stdio(0); cin.tie(0);
  int t = 1; cin>>t;
  while (t--) {
    test();
  }
}