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
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
#include <iostream>
//#define DEBUG false
const int MAX_N = 1000000; ///                              ZMIEŃ!!!!!!!!!!!!!!!!!11
int edges[MAX_N + 2];//                 + -
bool reachable[MAX_N + 2][6];// A B C D E E
const bool odd_trans[6][6] = { {1,0,0,0,0,1}, //A
							   {0,1,0,0,0,0}, //B
							   {1,0,1,0,0,1}, //C
							   {0,0,0,1,0,0}, //D
							   {0,1,0,0,1,0}, //E_+
							   {0,0,0,0,0,1} }; //E_-
//                                       + -
//                               A B C D E E
const bool even_trans[6][6] = { {1,0,0,0,0,0}, //A
								{0,1,0,0,0,1}, //B
								{0,0,1,0,0,0}, //C
								{0,1,0,1,0,1}, //D
								{1,0,0,0,1,0}, //E_+
								{0,0,0,0,0,1} }; //E_-

int main()
{
	int k;
	std::cin >> k;
	for (int testy = 0; testy < k; testy++) {
		int a,n;
		std::cin >> n;
		int first_nz = 0;
		int last_nz = 0;
		bool found_nz = false;
		
		edges[0] = 0;
		
		bool is_correct = true;
		//std::cout <<"[" << testy << " " << n << "]!!!!\n";
		for (int i = 0; i < n; i++) {
			std::cin >> a;
			if (a != 0) {
				last_nz = i+1;
				if (!found_nz) {
					first_nz = i+1;
					found_nz = true;
				}
			}
			
			edges[i + 1] = 2*a - edges[i];
			if (edges[i+1] < -2 && is_correct) {
				is_correct = false;
				std::cout << "NIE\n";
			}
		}
		//if (DEBUG) {
		//	std::cout << "edges ";
		//	for (int i = 0; i < n + 1; i++) std::cout << edges[i] << " ";
		//}
		if (!is_correct) continue;
		if (first_nz == last_nz) { //GRAF JEDNO WIERZCHOŁKOWY
			if (edges[first_nz] == 2) {
				std::cout << "TAK\n"; continue;
			}
			else {
				std::cout << "NIE\n"; continue;
			}
		}
		//std::cout << "\nfirst " << first_nz << " last " << last_nz;
		if (!found_nz) std::cout << "NIE\n"; //ALL ZEROS
		edges[n+1] = -edges[n];

		//if(DEBUG) std::cout << edges[n+1] << "\n";



		int cur_type = 0;
		for (int k = 0; k < 6; k++) reachable[last_nz][k] = false;
		switch (edges[last_nz])
		{
		case 0:
			reachable[last_nz][4] = true; break;
		case 2:
			reachable[last_nz][2 + ((last_nz) % 2)] = true; break;
		case -2:
			reachable[last_nz][2 +(1 - (last_nz) % 2)] = true; break;
		default:
			std::cout << "NIE\n"; is_correct = false;
		}
		if (!is_correct) continue;
		//if (DEBUG) {
		//	std::cout << "\n last " << last_nz << " ";
		//	for (int k = 0; k < 6; k++) if (reachable[last_nz][k]) std::cout << k << " ";
		//	std::cout << "\n";
		//}
		
		for (int i = last_nz-1; i >= 0; i--) {
			bool cur_available[6] = { 0,0,0,0,0,0 };
			//std::cout <<"pos " <<  i << "\n";
			if (edges[i] < 0) { std::cout << "NIE\n"; break; is_correct = false; }
			if (edges[i] >= 0) {
				cur_available[0 + (1 - i % 2)] = true; 
				cur_available[2 + (1 - i % 2)] = true;
			}
			if (edges[i] >= 2) {
				cur_available[0 + (i%2)] = true; 
				cur_available[4] = true; 
				cur_available[5] = true;
			}
			if (edges[i] > 2) {
				cur_available[2 + (i%2)] = true;
			}
			if (i == first_nz - 1) cur_available[5] = true;
			/*if (DEBUG) {
				std::cout << i << " available ";
				for (int k = 0; k < 6; k++) {
					if (cur_available[k]) std::cout << k << " ";
				}
				std::cout << "reachable ";
			}*/
			
			for (int k = 0; k < 6; k++) reachable[i][k] = false;
			for (int cur = 0; cur < 6; cur++) {
				for (int prev = 0; prev < 6; prev++) {
					if (cur_available[cur] && reachable[i + 1][prev] &&
						(((i+1) % 2 == 0 && even_trans[prev][cur]) || ((i+1) % 2 == 1 && odd_trans[prev][cur]))) {
					reachable[i][cur] = true;
					//if (DEBUG) std::cout << cur << " ";
					}
				}
			}
			//if (DEBUG) std::cout << "\n";
			if (i == first_nz-1) {
				if (reachable[i][5]) std::cout << "TAK\n";
				else std::cout << "NIE\n";
				break;
			}
		}

	}
}