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

#define ndl '\n'
#define ll long long
#define st first
#define nd second
#define debug(x) cout << #x << ": " << x << ndl
#define all(x) (x).begin(), (x).end()

using namespace std;

void rob() {
    ll n; cin>>n;
    vector<ll> t(n);
    for(auto &x:t) cin>>x;

    ll start_pool = 1;
    bool seen_nonzero = false;
    bool seen_zero_after_nonzero = false;
    

    for(ll i=0;i<n;i=i) {
        if(t[i] == 0) {
            if(seen_nonzero) {
                seen_zero_after_nonzero = true;
            }
            i++;
            continue;
        }

        if(seen_zero_after_nonzero) {
            cout<<"NIE\n";
            return;
        }

        seen_nonzero = true;

        if(start_pool == 0) {
            t[i]--;
            if(t[i] == 0) {
                i++;
                continue;
            }
        }

        if(i+1 == n || t[i+1] == 0) {
            t[i] -= start_pool;
            start_pool = 0;
            if(t[i] > 0) {
                cout<<"NIE\n";
                return;
            }
            i++;
            continue;
        } else {
            if(i+2==n || t[i+2] == 0) {
                ll odejm = min(t[i], t[i+1]);
                t[i] -= odejm;
                t[i+1] -= odejm;

                if(t[i] > 0) {
                    t[i] -= start_pool;
                    start_pool = 0;
                    if(t[i] > 0) {
                        cout<<"NIE\n";
                        return;
                    }
                    if(t[i+1] > 0) {
                        i++;
                    } else {
                        i+=2;
                    }
                    continue;
                } else {
                    if(t[i+1] > 0) {
                        i++;
                    } else {
                        i+=2;
                    }
                    continue;
                }



            } else {
                ll odejm = min(t[i], t[i+1]-1);
                t[i] -= odejm;
                t[i+1] -= odejm;

                if(t[i] > 0) {
                    t[i] -= start_pool;
                    start_pool = 0;
                    if(t[i] > 0) {
                        cout<<"NIE\n";
                        return;
                    }
                }

                i++;
                continue;
                
            }
        }
    }

    cout<<"TAK\n";
    return;


    // if (start_pool == 0) {
    //     cout<<"TAK\n";
    // } else {
    //     cout<<"NIE\n";
    // }
     
}

int main() {
    ios_base::sync_with_stdio(0); cin.tie(0);
    ll t;
    cin>>t;
    for(ll i=0;i<t;i++)
        rob();
}