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
 99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
#include <bits/stdc++.h>
using namespace std;
#define fwd(i, a, n) for (int i = (a); i < (n); i++)
#define rep(i, n) fwd(i, 0, n)
#define all(X) X.begin(), X.end()
#define sz(X) int(size(X))
#define pb push_back
#define eb emplace_back
#define st first
#define nd second
using pii = pair<int, int>; using vi = vector<int>;
using ll = long long; using ld = long double;
#ifdef LOC
auto SS = signal(6, [](int) { *(int *)0 = 0; });
#define DTP(x, y) auto operator << (auto &o, auto a) -> decltype(y, o) { o << "("; x; return o << ")"; }
DTP(o << a.st << ", " << a.nd, a.nd);
DTP(for (auto i : a) o << i << ", ", all(a));
void dump(auto... x) { (( cerr << x << ", " ), ...) << '\n'; }
#define deb(x...) cerr << setw(4) << __LINE__ << ":[" #x "]: ", dump(x)
#else
#define deb(...) 0
#endif

#define S 1000007

bool solve() {
	int n;
	cin >> n;
	vector<int> hands;
	for(int i = 1; i <= n; i++) {
		int x;
		cin >> x;
		if(x != 0 || !hands.empty())
			hands.pb(x);
	}
	while(hands.back() == 0)
		hands.pop_back();

	for(auto v: hands) {
		if(v == 0) {
			return false;
		}
	}
	if(hands.size() == 1) {
		if(hands[0] == 1)
			return true;
		return false;
	}

	int ends = 2;
	hands[0] *= 2;
	for(int i = 1; i < hands.size() - 1; i++) {
		hands[i] *= 2;
		if(hands[i-1] >= hands[i]) {
			int p = hands[i-1] - hands[i] + 1;
			if(ends < p)
				return false;
			ends -= p;
			hands[i-1] -= p;
		}
		hands[i] -= hands[i-1];
	}
	hands.back() *= 2;

	int lastt = hands.back();
	int prevv = hands[hands.size()-2];

	if(ends == 0) {
		if(lastt == prevv)
			return true;
		return false;
	} else if(ends == 1) {
		if(abs(lastt - prevv) == 1)
			return true;
		return false;
	} else {
		if((lastt == prevv) || abs(lastt - prevv) == 2)
			return true;
		return false;
	}
	return false;
}

int32_t main() {
	cin.tie(0)->sync_with_stdio(0);
	cout << fixed << setprecision(10);
	int t;
	cin >> t;
	while(t--) {
		if (solve()) {
			cout << "TAK\n";
		} else {
			cout << "NIE\n";
		}
	}
}

/*

7
3
1 3 1
2
5 7
3 
0 1 0
1
2
6
3 3 2 1 0 0
5
1 3 2 2 3
3
1 0 1

1
9
1 1 0 0 0 0 0 0 0
*/