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
#include <bits/stdc++.h>
using namespace std;
#define rep(i,a,n) for (int i=(a);i<(n);i++)
#define per(i,a,n) for (int i=(n)-1;i>=(a);i--)
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define SZ(x) ((int)(x).size())
typedef vector<int> VI;
typedef basic_string<int> BI;
typedef long long ll;
typedef pair<int,int> PII;
typedef double db;
mt19937 mrand(1111); 
const ll mod=1000000007;
int rnd(int x) { return mrand() % x;}
ll powmod(ll a,ll b) {ll res=1;a%=mod; assert(b>=0); for(;b;b>>=1){if(b&1)res=res*a%mod;a=a*a%mod;}return res;}
ll gcd(ll a,ll b) { return b?gcd(b,a%b):a;}
// head

const int N=1010000;
vector<array<int,4>> dp,pd;
int n,a[N];
bool gao(VI a) {
	dp.clear();
	dp.pb({0,0,0,0});
	rep(i,0,SZ(a)) {
		pd.clear();
		for (auto [vs,vt,l,r]:dp) {
			rep(cs,0,2-vs) rep(ct,0,2-vt) {
				int nl=a[i]-r-cs;
				int nr=cs-ct-(l-r-nl);
				if (nl<0||nr<0) continue;
				if (i!=SZ(a)-1&&nl==0&&nr==0) continue;
				pd.pb({vs+cs,vt+ct,nl,nr});
			}
		}
		sort(all(pd)); pd.erase(unique(all(pd)),pd.end());
		dp=pd;
	}
	return find(all(dp),array<int,4>{1,1,0,0})!=dp.end();
}
bool solve() {
	scanf("%d",&n);
	rep(i,1,n+1) scanf("%d",&a[i]);
	int l=1,r=n;
	while (a[l]==0) l++;
	while (a[r]==0) r--;
	rep(i,l,r+1) if (a[i]==0) return false;
	return gao(VI(a+l,a+r+1));
}

int _;
int main() {
	for (scanf("%d",&_);_;_--) {
		puts(solve()?"TAK":"NIE");
	}
}