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

using namespace std;

void solve(){
    int n;
    cin >> n;
    vector<int> arr(n+7);

    for(int i = 1; i <= n; i++){
        int a;
        cin >> arr[i];
    }
    for(int i = 1; i <= n; i++){
        int min_w = min(arr[i], arr[i-1]);
        min_w--;
        if(min_w > 0){
            arr[i] -= min_w;
            arr[i-1] -= min_w;
        }
    }
    bool ans = true;
    bool start = false;
    bool end = false;
    for(int i = 1; i <= n; i++){
        if(arr[i] > 2){
            ans = false;
            break;
        }
        if(arr[i] == 0){
            if(start){
                end = true;
            }
            continue;
        }
        if(end){
            ans = false;
            break;
        }
        if(!start){
            if(arr[i] == 2){
                if(arr[i+1] == 1){
                    arr[i+1] = 0;
                }else{
                    ans = false;
                    break;
                }
            }
            if(arr[i+1] == 2 or arr[i+1] == 3){
                arr[i+1]--;
            }
            start = true;
            continue;
        }
        if(arr[i] == 2){
            if(arr[i+1] == 0){
                ans = false;
                break;
            }
            arr[i+1]--;
        }
    }
    if(ans){
        cout << "TAK\n";
    }else{
        cout << "NIE\n";
    }
    



}

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