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
#ifndef LOCAL
#pragma GCC optimize("O3")
#endif
#include <bits/stdc++.h>
#define FOR(i,p,k) for(int i=(p);i<=(k);++i)
#define REP(i,n) FOR(i,0,(n)-1)
#define RFOR(i,p,n) for(int i=(p);i>=(n);--i)
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
#define ssize(x) int((x).size())
#define fi first
#define se second
#define V vector
#define pb push_back
#define eb emplace_back
#define C const
#define pn printf("\n")
using namespace std;
typedef long long ll;
typedef V<int> vi;
typedef V<ll> vll;
typedef const int ci;
typedef const ll cll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
void chmin(auto &a, auto b){a=min(a,b);}
void chmax(auto &a, auto b){a=max(a,b);}
ci inf = 2.1e9;
cll infll = 4.5e18;

int I(){
    int z;
    scanf("%d", &z);
    //cin >> z;
    return z;
}

void answer(){
    int n = I();
    vi wej(n);
    REP(i, n) wej[i] = I();
    vi niezerowe;
    REP(i, n) if(wej[i]) niezerowe.eb(i);
    assert(ssize(niezerowe));
    int poc = niezerowe[0];
    int kon = niezerowe.back();
    int dl = kon-poc+1;
    if(ssize(niezerowe) != dl){
        printf("NIE\n");
        return;
    }
    vi nowy(dl, 0);
    REP(i, dl) nowy[i] = wej[poc+i];

    if(dl == 1){
        if(nowy[0] == 1) printf("TAK\n");
        else printf("NIE\n");
        return;
    }
    /*
    if(dl == 2){
        if(abs(nowy[0]-nowy[1]) <= 1) printf("TAK\n");
        else printf("NIE\n");
        return;
    }
    */
    
    REP(maska, 4){
        vi vec = nowy;
        REP(i, dl) --vec[i];
        if(maska&1) --vec[1];
        if(maska&2) --vec[dl-2];

        int git = 1;
        REP(i, dl){
            if(vec[i] < 0){
                git = 0;
                break;
            }
            if(i+1 < dl){
                vec[i+1] -= vec[i];
                vec[i] = 0;
                if(vec[i+1] < 0){
                    git = 0;
                    break;
                }
            }
            if(vec[i]){
                git = 0;
                break;
            }
        }
        if(git){
            printf("TAK\n");
            return;
        }
    }
    printf("NIE\n");
}

int main(){
    //ios_base::sync_with_stdio(0);
    //cin.tie(0);
    int tt = 1;
    tt = I();
    while(tt--) answer();
}