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
#include <bits/stdc++.h>
using namespace std;
#define REP(i,a,b) for (int i = (a); i <= (b); ++i)
#define REPD(i,a,b) for (int i = (a); i >= (b); --i)
#define FORI(i,n) REP(i,1,n)
#define FOR(i,n) REP(i,0,int(n)-1)
#define mp make_pair
#define pb push_back
#define pii pair<int,int>
#define vi vector<int>
#define ll long long
#define SZ(x) int((x).size())
#define DBG(v) cerr << #v << " = " << (v) << endl;
#define FOREACH(i,t) for (typeof(t.begin()) i=t.begin(); i!=t.end(); i++)
#define fi first
#define se second

const int N = 1000100;

int n;
int a[N];

bool test() {
	scanf("%d", &n);
	FOR(i,n) scanf("%d", &a[i]);
	int lo = -1, hi = n-1;
	FOR(i,n) if (a[i]>0) {
		if (lo == -1) lo = i;
		hi = i;
	}
	REP(i,lo,hi) if (a[i]==0) return false;
	REP(i,lo,hi-1) {
		if (a[i] < 0) return false;
		a[i+1] -= a[i];
	}
	//REP(i,lo,hi) printf("%d ", a[i]);
	//printf("\n");
	if (abs(a[hi]) > 1) return false;
	if (a[hi] == 0) {
		bool odd=false, even=false;
		REP(i,lo,hi-1) if (a[i]==0) {
			if (i&1) odd=true;
			else even=true;
		}
		if (odd==false || even==false) return true;
		return false;
	}
	if (a[hi] == -1) {
		for (int i = hi; i > lo; i -= 2) a[i]++;
		a[hi-1]--;
		REP(i,lo,hi-1) if (a[i]<=0) return false;
		return true;
	}
	if (a[hi] == 1) {
		for (int i = hi-1; i > lo; i -= 2) a[i]++;
		REP(i,lo,hi-1) if (a[i]<=0) return false;
		return true;
	}
	return true;
}

int main() {
	int tt;
	scanf("%d", &tt);
	FOR(i,tt) {
		bool ok = test();
		if (ok) printf("TAK\n");
		else printf("NIE\n");
	}
	return 0;
}