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
// Arti1990, II UWr

#include <bits/stdc++.h>

#define forr(i, n)                  for(int i=0; i<n; i++)
#define FOREACH(iter, coll)         for(auto iter = coll.begin(); iter != coll.end(); ++iter)
#define FOREACHR(iter, coll)        for(auto iter = coll.rbegin(); iter != coll.rend(); ++iter)
#define lbound(P,K,FUN)             ({auto SSS=P, PPP = P-1, KKK=(K)+1; while(PPP+1!=KKK) {SSS = (PPP+(KKK-PPP)/2); if(FUN(SSS)) KKK = SSS; else PPP = SSS;} PPP;})
#define testy()                     int _tests; cin>>_tests; FOR(_test, 1, _tests)
#define CLEAR(tab)                  memset(tab, 0, sizeof(tab))
#define CONTAIN(el, coll)           (coll.find(el) != coll.end())
#define FOR(i, a, b)                for(int i=a; i<=b; i++)
#define FORD(i, a, b)               for(int i=a; i>=b; i--)
#define MP                          make_pair
#define PB                          push_back
#define ff                          first
#define ss                          second
#define deb(X)                      X;
#define SIZE(coll) 					((int)coll.size())

#define M 1000000007
#define INF 1000000007LL

using namespace std;

int n, m, a;
int tab[1000007], t[1000007];
int res = 0;

int solve(bool read)
{
    if(read)
    {
        cin >> n;
        forr(i, n)
            cin >> tab[i];
    }
    //forr(i, n)
    //    cout << tab[i] << " ";
    //cout << '\n';

    int p = 0, k = n-1;
    while(tab[p] == 0)
        p++;
    while(tab[k] == 0)
        k--;

    while(tab[p] < tab[p+1])
    {
        tab[p+1] -= tab[p];
        tab[p] = 0;
        p++;
    }
    while(tab[k] < tab[k-1])
    {
        tab[k-1] -= tab[k];
        tab[k] = 0;
        k--;
    }

    //cout << "p: " << p << ", k: " << k << '\n';
    FOR(i, p, k)
    {
        if(tab[i] == 0)
            return 0;
        if(tab[i] > 1)
        {
            if(tab[i+1] < tab[i])
                return 0;
            tab[i+1] -= tab[i]-1;
        }
        tab[i]--;
    }

    return 1;
}

void gen(int nr)
{
    if(nr == n)
    {
        forr(i, n)
            tab[i] = t[i];
        res += solve(0);
    }
    else
    {
        FOR(i, 1, 8)
        {
            if(nr == 0)
                cout << i << endl;
            t[nr] = i;
            gen(nr+1);
        }
    }
}

long long testuj()
{
    n = 10;
    gen(0);
    return res;
}

int main()
{
    std::ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

    //cout << testuj() << '\n';
    //return 0;

    testy()
        cout << (solve(1) ? "TAK" : "NIE") << '\n';

    return 0;
}