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

using namespace std;
typedef long long ll;
const int MAXN=1e6;

int arr[MAXN+5];
int dpP[MAXN+5][3];
int dpS[MAXN+5][3];

void solve()
{
	int n;
	cin >> n;
	int st=0,en=0;
	for(int i=1;i<=n;i++){
		cin >> arr[i];
		if(!st && arr[i]) st=i;
		if(arr[i]) en=i;
	}
	for(int i=st;i<=en;i++){
		if(arr[i]==0){
			cout << "NIE\n";
			return;
		}
	}
	//ciag od st do en ma wszystkie elem nie zerowe
	//licze dp na pref
	dpP[st][0]=arr[st]-1;
	dpP[st][1]=dpP[st][2]=-1;
	for(int i=st+1;i<=en;i++){
		//licze dpP[i][0] / koncze w i
		if(dpP[i-1][0]!=-1){
			if(dpP[i-1][0] >= arr[i]-1) dpP[i][0]=-1;
			else dpP[i][0]=(arr[i]-2)-dpP[i-1][0];
		}
		else dpP[i][0]=-1;
		
		//licze dpP[i][1]
		if(dpP[i-1][0]!=-1){
			if(dpP[i-1][0] >= arr[i]) dpP[i][1]=-1;
			else dpP[i][1]=(arr[i]-1)-dpP[i-1][0];
		}
		else dpP[i][1]=-1;
		
		//licze dpP[i][2]
		if(dpP[i-1][2]!=-1){
			if(dpP[i-1][2] >= arr[i]) dpP[i][2]=-1;
			else dpP[i][2]=(arr[i]-1)-dpP[i-1][2];
		}
		else if(dpP[i-1][1]!=-1){
			if(dpP[i-1][1] >= arr[i]) dpP[i][2]=-1;
			else dpP[i][2]=(arr[i]-1)-dpP[i-1][1];
		}
		else dpP[i][2]=-1;
	}
	//analogicznie licze dp na suf
	dpS[en][0]=arr[en]-1;
	dpS[en][1]=dpS[en][2]=-1;
	for(int i=en-1;i>=st;i--){
		//licze dpS[i][0] / koncze w i
		if(dpS[i+1][0]!=-1){
			if(dpS[i+1][0] >= arr[i]-1) dpS[i][0]=-1;
			else dpS[i][0]=(arr[i]-2)-dpS[i+1][0];
		}
		else dpS[i][0]=-1;
		
		//licze dpS[i][1]
		if(dpS[i+1][0]!=-1){
			if(dpS[i+1][0] >= arr[i]) dpS[i][1]=-1;
			else dpS[i][1]=(arr[i]-1)-dpS[i+1][0];
		}
		else dpS[i][1]=-1;
		
		//licze dpS[i][2]
		if(dpS[i+1][2]!=-1){
			if(dpS[i+1][2] >= arr[i]) dpS[i][2]=-1;
			else dpS[i][2]=(arr[i]-1)-dpS[i+1][2];
		}
		else if(dpS[i+1][1]!=-1){
			if(dpS[i+1][1] >= arr[i]) dpS[i][2]=-1;
			else dpS[i][2]=(arr[i]-1)-dpS[i+1][1];
		}
		else dpS[i][2]=-1;
	}
	//rozwazam kazda pozycje startowa
	bool ans=0;
	if(dpS[st][0]==0 || dpS[st][1]==0 || dpS[st][2]==0) ans=1;
	if(dpP[en][0]==0 || dpP[en][1]==0 || dpP[en][2]==0) ans=1;
	for(int i=st;i<=en-1;i++){
		
		if(dpP[i][0]!=-1){
			if(dpS[i+1][1]!=-1){
				if(dpS[i+1][1]==dpP[i][0] || dpS[i+1][1]==dpP[i][0]+1) ans=1;
			}
			if(dpS[i+1][2]!=-1){
				if(dpS[i+1][2]==dpP[i][0] || dpS[i+1][2]==dpP[i][0]+1) ans=1;
			}
			if(dpS[i+1][0]!=-1){
				if(abs(dpP[i][0]-dpS[i+1][0]) <= 1) ans=1;
			}
		}
		if(dpS[i+1][0]!=-1){
			if(dpP[i][1]!=-1){
				if(dpP[i][1]==dpS[i+1][0] || dpP[i][1]==dpS[i+1][0]+1) ans=1;
			}
			if(dpP[i][2]!=-1){
				if(dpP[i][2]==dpS[i+1][0] || dpP[i][2]==dpS[i+1][0]+1) ans=1;
			}
			if(dpP[i][0]!=-1){
				if(abs(dpS[i+1][0]-dpP[i][0])<=1) ans=1;
			}
		}
		if(ans) break;
	}
	if(ans) cout << "TAK\n";
	else cout << "NIE\n";
}

int main()
{
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	
	int t;
	cin >> t;
	while(t--) solve();
	
	return 0;
}