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
#include "bits/stdc++.h"
using namespace std;
#define all(x) x.begin(),x.end()
template<typename A, typename B> ostream& operator<<(ostream &os, const pair<A, B> &p) { return os << p.first << " " << p.second; }
template<typename T_container, typename T = typename enable_if<!is_same<T_container, string>::value, typename T_container::value_type>::type> ostream& operator<<(ostream &os, const T_container &v) { string sep; for (const T &x : v) os << sep << x, sep = " "; return os; }
#ifdef LOCAL
#include "debug.h"
#else
#define debug(...) 42
#define ASSERT(...) 42
#endif
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int,int> pi;
const int oo = 1e9;

bool solve() {
    int n; cin >> n;
    vector<ll> a(n);
    for(auto& i : a) cin >> i;
    int l=0,r=n-1;
    while(!a[l]) ++l;
    while(!a[r]) --r;
    a = vector<ll>(a.begin()+l,a.begin()+r+1);
    n = a.size();
    for(int s=0;s<min(n,2);++s) {
        for(int t=max(0,n-2);t<n;++t) if(s<=t) {
            auto b = a;
            for(int j=s;j<=t;++j) b[j]--;
            bool good=1;

            for(int j=0;j<n;++j) {
                if(b[j]<0) {
                    good=0;
                }
            }
            ll left=0;
            for(auto x : b) {
                left = x-left;
                if(left<0) good=0;

            }
            if(good and left==0) {
                return true;
            }
            
        }
    }
    
    return false;

}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    int t; cin >> t;
    while(t--) {
        if(solve()) {
            cout << "TAK\n";
        } else cout << "NIE\n";
    }
}