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


using namespace std;
#define ll long long
#define ld long double
#define all(a) (a).begin(), (a).end()
#define allr(a) (a).rbegin(), (a).rend()
#define F first
#define S second
#define pb push_back
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
/*
#ifndef ONLINE_JUDGE
    #include <cpp-dump.hpp>
#endif
*/
constexpr ll mod = 1e9+7;

ll power(ll a, ll b){
    ll res = 1;
    while(b){
        if(b&1) res = res * a % mod;
        a = a * a % mod;
        b >>= 1;
    }
    return res;
}

/*
ll fact[300001];
ll C(ll n, ll k){
    if(k < 0 || k > n) return 0;
    return fact[n] * power(fact[k], mod-2) % mod * power(fact[n-k], mod-2) % mod;
}
*/

void dzik77() {

    int n; cin >> n;
    vector<int> a(n);
    for (int i = 0; i < n; i++){
        cin >> a[i];
    }
    vector<int> b = a;
    while(n > 1 && a[n-1] == 0){
        n--;
    }
    int s = 0;
    while(s < n && a[s] == 0){
        s++;
    }
    if(s == n){
        cout << "TAK\n";
        return;
    }
    if(n-s == 1){
        if(a[s] > 1){
            cout << "NIE\n";
            return;
        }
        else{
            cout << "TAK\n";
            return;
        }
    }
    if(n-s == 2){
        int v = abs(a[s] - a[s+1]);
        if(v <= 1){
            cout << "TAK\n";
        }
        else{
            cout << "NIE\n";
        }
        return;
    }
    bool ok = false;
    int i = s+1;
    for (; i < n; i++){
        if(a[i] == 0){
            cout << "NIE\n";
            return;
        }
        a[i] -= (max(a[i-1] - 1,0));
        a[i-1] = 1;
        if(a[i] <= 0 && i < n-1){
            break;
        }
    }
    if(i == n){
        if(a[n-1] == 1 || a[n-1] == 0){
            ok = true;
        }
    }
    i = s+2;
    b[s+1] -= b[s];
    if(b[s+1] > 0){
        for (; i < n; i++){
            b[i] -= (max(b[i-1] - 1,0));
            b[i-1] = 1;
            if(b[i] <= 0 && i < n-1){
                break;
            }
        }
    }
    if(i == n){
        if(b[n-1] == 1 || b[n-1] == 0){
            ok = true;
        }
    }
    if(ok){
        cout << "TAK\n";
    }
    else{
        cout << "NIE\n";
    }

}

int32_t main()
{

    ios::sync_with_stdio(0);
    cin.tie(0);

    /*
    fact[0] = 1;
    for (int i = 1; i < 300001; i++){
        fact[i] = fact[i-1] * i % mod;
    }
    */

    int t = 1;
    cin >> t;
    while(t--)
		dzik77();

    return 0;
}