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

#define mp make_pair
#define pb push_back
#define st first
#define nd second
#define fi first
#define se second
#define vt vector
#define FOR(a, b, c)  for(int a=b; a<c; ++a)
#define all(a)     (a).begin(),(a).end()
#define sz(a)      (int)(a).size()

typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> pll;
typedef pair<int, int> pii;
typedef vector<int> vi; 
typedef vector<ll> vll;
typedef pii PII;
typedef pll PLL;

constexpr ll nax = 2e5+6969, INF = 1e9+2137;
constexpr ld eps = 1e-9;

mt19937_64 rng(6969);
// mt19937_64 rng(chrono::system_clock::now().time_since_epoch().count());

inline ll rand(ll l, ll r) {
	return uniform_int_distribution<ll>(l, r)(rng);
}

void test_case() {

    int n; 
    cin >> n; 
    vector<pii> v(n); 
    for(auto &e: v) {
        int x; 
        cin >> x; 
        e = mp(x, x); 
    }

    bool not_zero = false, start = false; 

    for(int i = 0; i < n - 1; i++) {
        if(v[i].se == 0 && v[i].fi == 0) {
            if(not_zero == false)
                continue; 
            else   
                break; 
        }

        not_zero = true; 

        if((start && v[i].fi == v[i+1].se) || v[i].fi < v[i+1].se) {
            v[i+1].se -= v[i].fi; 
            v[i].fi = 0; 
        }
        else if((!start) && v[i].fi == v[i+1].se) {
            v[i+1].se = 1; 
            v[i].fi = 1; 
            start = true;
        }
        else {
            v[i].fi -= v[i+1].se; 
            v[i+1].se = 0; 
        }

        if(v[i].se <= v[i+1].fi) {
            v[i+1].fi -= v[i].se; 
            v[i].se = 0; 
        }
        else {
            v[i].se -= v[i+1].fi; 
            v[i+1].fi = 0; 
        }
    }

    int up = 0, down = 0; 
    for(int i = 0; i < n; i++) {
        if(v[i].fi == 1)
            up++; 
        if(v[i].se == 1)
            down++; 
        if(v[i].fi > 1 || v[i].se > 1) {
            cout << "NIE\n"; 
            return; 
        }
    }
    if(up != 1 || down != 1) {
        // for(auto e: v) {
        //     cout << e.fi << ", " << e.se << "\n"; 
        // }
        cout << "NIE\n"; 
    }
    else {
        cout << "TAK\n"; 
    }

}

int32_t main() {
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);

    int qq; 
    cin >> qq; 
    while(qq--) {
        test_case(); 
    }

    return 0;
}