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
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;

template<class T> using ordered_set =tree<T, null_type, less<T>, rb_tree_tag,tree_order_statistics_node_update> ;

#define debug(x) cout << "[" <<  #x << " " << x << "] ";

#define ar array
#define ll long long
#define ld long double
#define sz(x) ((int)x.size())
#define all(a) (a).begin(), (a).end()

typedef vector<int> vi;
typedef pair<int,int> pi;

const int MAX_N = 1e5 + 5;
const ll MOD = 1e9 + 7;
const ll INF = 1e9;
const ld EPS = 1e-9;

void solve() {
    int n;
    cin >> n;
    vector<ll> a(n);
    for (int i = 0; i < n; i++) {
        cin >> a[i];
    }

    vi nonzero_segment;
    for (int i = 0; i < n; i++) {
        if (a[i] != 0) {
            if (!nonzero_segment.empty()) {
                cout << "NIE\n";
                return;
            }
            int j = i;
            while (j < n && a[j] != 0) {
                nonzero_segment.push_back(a[j]);
                j++;
            }
            i = j;
        }
    }

    if (sz(nonzero_segment) == 1){
        cout << (nonzero_segment[0] == 1 ? "TAK\n" : "NIE\n");
        return;
    }
    if (sz(nonzero_segment) == 2){
        cout << (abs(nonzero_segment[0] - nonzero_segment[1]) == 1 ? "TAK\n" : "NIE\n");
        return;
    }
    vi nonzero_segment_copy = nonzero_segment;

    nonzero_segment[0]--;
    bool ok = true;
    for (int i = 1; i < sz(nonzero_segment); i++) {
        if (nonzero_segment[i] < nonzero_segment[i-1]) {
            if (abs(nonzero_segment[i] - nonzero_segment[i-1]) == 1 && sz(nonzero_segment)-i == 1) {
                ok = true;
                break;
            }
            ok = false;
            break;
        }
        if (nonzero_segment[i]  == nonzero_segment[i-1]) {
            if (sz(nonzero_segment)-i == 1) {
                ok = true;
                break;
            }
            i++;
        }
        else{
            nonzero_segment[i] -= nonzero_segment[i-1];
            if (nonzero_segment[i] == 0)i++;
        }
    }

    if (ok) {
        cout << "TAK\n";
        return;
    }

    nonzero_segment_copy[1]--;
    for (int i = 1; i < sz(nonzero_segment_copy); i++) {
        if (nonzero_segment_copy[i] < nonzero_segment_copy[i-1]) {
            if (abs(nonzero_segment_copy[i] - nonzero_segment_copy[i-1]) == 1 && sz(nonzero_segment_copy)-i == 1) {
                ok = true;
                break;
            }
            ok = false;
            break;
        }
        if (nonzero_segment_copy[i]  == nonzero_segment_copy[i-1]) {
            if (sz(nonzero_segment_copy)-i == 1) {
                ok = true;
                break;
            }
            i++;
        }
        else{
            nonzero_segment_copy[i] -= nonzero_segment_copy[i-1];
            if (nonzero_segment_copy[i] == 0)i++;
        }
    }
    cout << (ok ? "TAK\n" : "NIE\n");
}


int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
    int tc = 1;
    cin >> tc;
    for (int t = 1; t <= tc; t++) {
        // cout << "Case #" << t << ": ";
        solve();
    }
}