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

using namespace std;
#define pb push_back
#define st first
#define nd second
typedef long long ll;
typedef long double ld;
const ll I = 1000'000'000'000'000'000LL;
const int II = 2'000'000'000;
const ll M = 1000'000'007LL;
const int N = 1000'007;
int tab[N];

bool Check(int n, int p, int k)
{
    bool czy[3]; int val[3];
    bool nw[3]; int nval[3];
    czy[0] = 1; czy[1] = (p == 1); czy[2] = 0;
    val[0] = tab[1]; val[1] = ((int)czy[1]) * tab[1]; val[2] = 0;
    //cout << "\nS: " << p << " " << k << "\n";

    for(int i = 2; i <= n; ++i)
    {
        //for(int r = 0; r < 3; ++r)
            //cout << r << ": " << val[r] << " " << czy[r] << "\n";
        for(int r = 0; r < 3; ++r) {nw[r] = 0; nval[r] = -1;}
        
        bool xd = 0;
        for(int r = 0; r < 3; ++r)
        {
            if(val[r] == 0) czy[r] = 0;
            xd += czy[r];
        }
        if(!xd)
            return 0;

        if(czy[0] && tab[i] >= val[0])
        {
            nw[0] = 1;
            nval[0] = tab[i] - val[0];
        }

        //cout << !nw[0] << " " << i % 2 << "\n";
        if(i % 2 == p)
            if(nw[0])
            {
                nw[1] = 1;
                nval[1] = nval[0];
            }

        //cout << !nw[0] << " " << czy[1] << " " << val[1] - 1 << " " << tab[i] << "\n";
        if(!nw[1] && czy[1] && (val[1] - 1) <= tab[i])
        {
            nw[1] = 1;
            nval[1] = tab[i] - (val[1] - 1);
        }
        if(i % 2 == k)
            if(nw[1])
            {
                nw[2] = 1;
                nval[2] = nval[1];
            }
        if(!nw[2] && czy[2] && val[2] <= tab[i])
        {
            nw[2] = 1;
            nval[2] = tab[i] - val[2];
        }
        for(int r = 0; r < 3; ++r)
            {val[r] = nval[r]; czy[r] = nw[r];}
        //cout << tab[i] << "\n";
        //for(int r = 0; r < 3; ++r)
            //cout << r << ": " << val[r] << " " << czy[r] << "\n";
        //cout << "\n";
    }
    return ((val[0] == 0 && czy[0]) || (val[1] == 1 && czy[1]) || (val[2] == 0 && czy[2]));
}

void Solve()
{
    int n, x;
    vector<int> v;
    cin >> n;
    for(int i = 1; i <= n; ++i)
        {cin >> x; v.pb(x);}
    while((int)v.size() > 0 && v.back() == 0)
        v.pop_back();
    int s = 0;
    while(s < (int)v.size() && v[s] == 0)
        ++s;
    n = (int)v.size() - s;
    for(int i = s; i < (int)v.size(); ++i)
        tab[i - s + 1] = v[i];

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

    for(int a = 0; a < 2; ++a)
        for(int b = 0; b < 2; ++b)
            if(Check(n, a, b))
            {
                cout << "TAK\n";
                return;
            }
    cout << "NIE\n";
}

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    int t; cin >> t;
    while(t--)
        Solve();

    return 0;
}