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

#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define FORD(i, a, b) for(int i = (a); i >= (b); --i)
#define VAR(v, i) __typeof(i) v=(i)
#define FORE(i, c) for(VAR(i, (c).begin()); i != (c).end(); ++i)


#define VI vector<int>
#define PII pair<int,int>
#define st first
#define nd second
#define mp make_pair
#define pb push_back
#define lint long long int


#define debug(x) {cerr <<#x <<" = " <<x <<endl; }
#define debug2(x,y) {cerr <<#x <<" = " <<x << ", "<<#y<<" = "<< y <<endl; }
#define debug3(x,y,z) {cerr <<#x <<" = " <<x << ", "<<#y<<" = "<< y << ", " << #z << " = " << z <<endl; }
#define debugv(x) {{cerr <<#x <<" = "; FORE(itt, (x)) cerr <<*itt <<", "; cerr <<endl; }}
#define debugt(t,n) {{cerr <<#t <<" = "; FOR(it,0,(n)) cerr <<t[it] <<", "; cerr <<endl; }}


#define make( x) int (x); scanf("%d",&(x));
#define make2( x, y) int (x), (y); scanf("%d%d",&(x),&(y));
#define make3(x, y, z) int (x), (y), (z); scanf("%d%d%d",&(x),&(y),&(z));
#define make4(x, y, z, t) int (x), (y), (z), (t); scanf("%d%d%d%d",&(x),&(y),&(z),&(t));
#define IOS ios_base::sync_with_stdio(0)
#define HEAP priority_queue


#define read( x) scanf("%d",&(x));
#define read2( x, y) scanf("%d%d",&(x),&(y));
#define read3(x, y, z) scanf("%d%d%d",&(x),&(y),&(z));
#define read4(x, y, z, t) scanf("%d%d%d%d",&(x),&(y),&(z),&(t));


using namespace std;

int n;
VI v;

bool doit2(int it) {
	if (v[it] == 0) return false;
	if (it == n-1) return (v[it] == 1);
	if (it+1 == n-1) {
		return (v[it+1] == v[it]) || (v[it+1] == v[it] - 1);
	}
	if (v[it] > v[it+1]) return false;
	if (v[it] == v[it+1]) return doit2(it+2);
	v[it+1] -= (v[it]-1);
	return doit2(it+1);
}

bool doit(int it) {
	if (v[it] == 0) return false;
	if (it == n-1) return (v[it] == 1);
	// a,b,... <=> a-1,b-1,... o ile b>=2
	if (v[it+1] >= 2) {
		int minus = min(v[it+1]-1, v[it]);
		v[it] -= minus;
		v[it+1] -= minus;
		if (v[it] == 0) return doit(it+1);
	}
	if (v[it] >= 3) return false;
	if (v[it]==2) {
		return (v[it+1] == 1 && it+1 == n-1);
	} 
	if (v[it+1] == 0) return false;
	// (1,1,....)
	if (it+1 == n-1) return true;
	return doit2(it+2);
}


void solve() {
	read(n);
	v.clear();
	FOR(i,0,n) {
		make(a); v.pb(a);
	}
	while (v.back() == 0) {
		v.pop_back(); n--;
	}
	int start = 0;
	while (v[start] == 0) start++;
	if (doit(start)) printf("TAK\n");
	else printf("NIE\n");
}


int main() {
	make(z);
	while (z--) {
		solve();
	}
}