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
#include <cstdio>
using namespace std;

#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define FORD(i,a,b) for(int i=(b)-1;i>=(a);--i)
#define REP(i,n) FOR(i,0,n)
#define REPD(i,n) FORD(i,0,n)
#define INT(x) int x; scanf("%d", &x)

typedef long long LL;

int a[1000000], a1[1000000], a2[1000000];
bool e1[1000000], e2[1000000];

void test() {
	INT(n);
	REP(i,n) scanf("%d", &a[i]);
	LL s = 0;
	REP(i,n) s += a[i];
	if (s == 1) {
		printf("TAK\n");
		return;
	}
	a1[0] = a[0];
	e1[0] = 0;
	REP(i,n-1) {
		e1[i + 1] = e1[i];
		if (a1[i] == -1 || a[i + 1] < a1[i])
			a1[i + 1] = -1;
		else if (!a1[i])
			a1[i + 1] = a[i + 1];
		else {
			a1[i + 1] = a[i + 1] - a1[i] + e1[i + 1];
			if (!a1[i + 1]) {
				++a1[i + 1];
				e1[i + 1] = 1;
			}
		}
	}
	a2[n - 1] = a[n - 1];
	e2[n - 1] = 0;
	REPD(i,n-1) {
		e2[i] = e2[i + 1];
		if (a2[i + 1] == -1 || a[i] < a2[i + 1])
			a2[i] = -1;
		else if (!a2[i + 1])
			a2[i] = a[i];
		else {
			a2[i] = a[i] - a2[i + 1] + e2[i];
			if (!a2[i]) {
				++a2[i];
				e2[i] = 1;
			}
		}
	}
	REP(i,n-1) {
		if (a1[i] > 0 && a2[i + 1] > 0 && (a1[i] == a2[i + 1] || a1[i] == a2[i + 1] + 1 && !e2[i + 1] || a1[i] + 1 == a2[i + 1] && !e1[i])) {
			printf("TAK\n");
			return;
		}
	}
	printf("NIE\n");
}

int main() {
	INT(t);
	REP(tt,t) test();
}