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

const int N = 1e6+7;
int n;
int tab[N],k[N];

bool solve(){
    
    cin >> n;
    for(int i = 1;i <= n;i++){
        cin >> k[i];
        tab[i] = k[i];
    }
    
    {
        static int zmiany;
        zmiany = 0;
        for(int i = 1;i <= n+1;i++){
            if((tab[i] == 0 && tab[i-1] != 0) || (tab[i] != 0 && tab[i-1] == 0)) zmiany++;
        }
        if(zmiany > 2) return 0;
    }
    for(int i = 1;i < n;i++){
        if(tab[i] >= tab[i+1] + 2) return 0;
        else if(tab[i] == tab[i+1] + 1){
            return (tab[i+2] == 0);
        }else if(tab[i] == tab[i+1]){
            tab[i] = 0;
            tab[i+1] = 0;
            i++;
        }else{
            tab[i+1] -= tab[i];
            tab[i] = 0;
        }
    }
    {
        static int zliczamy;
        zliczamy = 0;
        for(int i = 1;i <= n;i++){
            if(tab[i] > 0){
                if(tab[i] > 1 || zliczamy == 1) return 0;
                zliczamy++;
            }
        }
    }
    for(int i = 1;i <= n;i++){
        tab[n-i+1] = k[i];
    }
    for(int i = 1;i < n;i++){
        if(tab[i] >= tab[i+1] + 2) return 0;
        else if(tab[i] == tab[i+1] + 1){
            return (tab[i+2] == 0);
        }else if(tab[i] == tab[i+1]){
            tab[i] = 0;
            tab[i+1] = 0;
            i++;
        }else{
            tab[i+1] -= tab[i];
            tab[i] = 0;
        }
    }
    {
        static int zliczamy;
        zliczamy = 0;
        for(int i = 1;i <= n;i++){
            if(tab[i] > 0){
                if(tab[i] > 1 || zliczamy == 1) return 0;
                zliczamy++;
            }
        }
    }
    
    return 1;
}

signed main(){
    iostream::sync_with_stdio(0);
    cin.tie(0);
    int t = 1;
    cin >> t;
    while(t--){
        if(solve()) cout << "TAK\n";
        else cout << "NIE\n";
    }

    return 0;
}