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

#define all(x) begin(x),end(x)
#define pb push_back
#define st first
#define nd second

typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

const int INF = 2e9;
const ll LLINF = 2e18;

void solve()
{
    int n;
    cin>>n;
    vi a(n);
    for(auto& x:a)
        cin>>x;

    int l=0,r=n-1;
    while(a[l]==0)
        ++l;
    while(a[r]==0)
        --r;

    for(int i=l; i<=r; ++i)
        if(a[i]==0)
        {
            cout<<"NIE\n";
            return;
        }

    int found=0;
    while(l<r-1)
    {
        if(a[l]>a[l+1]||a[r]>a[r-1])
        {
            cout<<"NIE\n";
            return;
        }
        if(a[l]<a[l+1])
        {
            a[l+1]-=(a[l]-found);
            ++l;
            continue;
        }
        if(a[r]<a[r-1])
        {
            a[r-1]-=a[r];
            --r;
            continue;
        }
        found=1;
        ++l;
        a[l]=1;
    }

    if(l==r)
    {
        if(a[l]==1)
            cout<<"TAK\n";
        else
            cout<<"NIE\n";
        return;
    }

    if(a[l]==a[r] || (found==0 && (a[l]==a[r]+1||a[l]==a[r]-1)))
        cout<<"TAK\n";
    else
        cout<<"NIE\n";
}

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