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

#define ll long long
#define ld long double
#define endl '\n'
#define st first
#define nd second
#define pb push_back
#define sz(x) (int)(x).size()
#define all(x) (x).begin(), (x).end()
#define FOR(i,l,r) for(int i=(l);i<=(r);i++)
#define ROF(i,r,l) for(int i=(r);i>=(l);i--)
using namespace std;
ll infl=1000000000000000007;
int inf=1000000007;
int mod=998244353;
int mod1=998244353;

#ifdef DEBUG
auto&operator<<(auto&o,pair<auto,auto>p){return o<<"("<<p.first<<", "<<p.second<<")";}
auto operator<<(auto&o,auto x)->decltype(x.end(),o){o<<"{";int i=0;for(auto e:x)o<<","+!i++<<e;return o<<"}";}
#define debug(X...)cerr<<"["#X"]: ",[](auto...$){((cerr<<$<<"; "),...)<<endl;}(X)
#else
#define debug(...){}
#endif

const int N=1000007;

ll a[N];
bool DP[N][3][3];

signed main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int tt;
    cin>>tt;
    while(tt--)
    {
		int n;
		cin>>n;
		int L=inf,R=-inf;
		FOR(i,1,n) 
		{
			cin>>a[i];
			a[i]*=2;
			if(a[i]>0&&L==inf) L=i;
			if(a[i]>0) R=i-1;
		}
		DP[0][0][0]=1;
		FOR(i,1,n)
		{
			a[i]-=a[i-1];
			debug(i,a[i]);
			FOR(x,0,2) 
			{
				FOR(y,0,2)
				{
					DP[i][x][y]=DP[i-1][x][y];
					if(x>0&&i%2==0) DP[i][x][y]|=DP[i][x-1][y];
					if(y>0&&i%2==1) DP[i][x][y]|=DP[i][x][y-1];
				}
			}
			FOR(x,0,2) 
			{
				FOR(y,0,2)
				{
					ll val=a[i];
					if(i%2==0) val+=y-x;
					else val+=x-y;
					if(val<0) DP[i][x][y]=0;
					if(i==n&&val!=0) DP[i][x][y]=0;
					if(i>=L&&i<=R&&val==0) DP[i][x][y]=0;
				}
			}
		}		
		if(DP[n][2][0]||DP[n][1][1]||DP[n][0][2]) cout<<"TAK"<<endl;
		else cout<<"NIE"<<endl;
	}
    
    
    
    return 0;
}