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
120
121
122
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;

bool remove_zeros(deque<int> &A)
{
	while (A.size() && A.front() == 0)
		A.pop_front();
	while (A.size() && A.back() == 0)
		A.pop_back();
	for (auto &a : A)
	{
		if (a == 0)
			return 0;
	}
	return 1;
}

bool solve()
{
	int N;
	cin >> N;
	deque<int> A(N);
	for (auto &a : A)
		cin >> a;

	if (!remove_zeros(A))
		return 0;

	while (A.size() > 1)
	{
		if (A[0] != A[1])
		{
			int x = min(A[0], A[1]);
			A[0] -= x;
			A[1] -= x;
		}
		else
		{
			if (A[0] == A[1])
				A[0] = A[1] = 1;
			break;
		}
		if (A[0] == 0)
			A.pop_front();
		else
			break;
	}

	while (A.size() > 1)
	{
		int n = A.size();
		if (A[n-1] != A[n-2])
		{
			int x = min(A[n-1], A[n-2]);
			A[n-1] -= x;
			A[n-2] -= x;
		}
		else
		{
			if (A[n-1] == A[n-2])
				A[n-1] = A[n-2] = 1;
			break;
		}
		if (A[n-1] == 0)
			A.pop_back();
		else
			break;
	}

	if (!remove_zeros(A))
		return 0;

	if (A.size() == 1)
		return (A[0] == 1);
	if (A.size() == 2)
		return (abs(A[0] - A[1]) <= 1);

	for (int i = 0; i < A.size(); i++)
	{
		if (A[i] != 1)
		{
			int x = min(A[i], A[i+1]) - 1;
			A[i] -= x;
			A[i+1] -= x;
		}
		if (A[i] != 1)
			break;
	}
	for (int i = A.size()-1; i > 0; i--)
	{
		if (A[i] != 1)
		{
			int x = min(A[i], A[i-1]) - 1;
			A[i] -= x;
			A[i-1] -= x;
		}
		if (A[i] != 1)
			break;
	}

	if (!remove_zeros(A))
		return 0;

	for (auto &a : A)
	{
		if (a != 1)
			return 0;
	}

	return 1;	
}

int main()
{
	ios::sync_with_stdio(0); cin.tie(0);

	int T;
	cin >> T;
	while (T--)
		cout << (solve() ? "TAK" : "NIE") << "\n";
}