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
124
125
126
127
128
#include <iostream>
#include <vector>

using namespace std;

long long n;
long long tmp;
vector <long long> v;
vector <long long> vcopy;
long long ktore_wyszukiwanie = 0;
long long doodjecia;
bool sameZera;

void copyvtovcopy()
{
    for(int i=0; i<n; i++)
    {
        vcopy[i] = v[i];
    }
}

bool solve()
{
    v.clear();
    vcopy.clear();

    cin >> n;

    for (int i = 0; i < n; i++)
    {
        cin >> tmp;
        v.push_back(tmp);
        vcopy.push_back(0);
    }


    copyvtovcopy();

    ktore_wyszukiwanie = 0;

    for (int i = 0; i < n; i++)
    {
        if (v[i] != 0)
        {
            if (ktore_wyszukiwanie > 1)
            {
                break;
            }
            ktore_wyszukiwanie++;

            copyvtovcopy();

            tmp = i;
            vcopy[i]--;;

            while (true)
            {
                if (tmp > 0 && vcopy[tmp - 1] > 0)
                {
                    vcopy[tmp - 1]--;
                    tmp = tmp - 1;
                }
                else if (tmp < n-1 && vcopy[tmp + 1] > 0)
                {

                    doodjecia = min(vcopy[tmp], vcopy[tmp + 1]) - 5;

                    if (doodjecia > 5) // > 0 ale dla pewnosci > 5 :D
                    {
                        vcopy[tmp] -= doodjecia;
                        vcopy[tmp + 1] -= doodjecia;
                    }
                    else
                    {
                        vcopy[tmp + 1]--;
                        tmp = tmp + 1;
                    }
                }
                else
                {
                    break;
                }
                
            }

            sameZera = true;
            for (int j = 0; j < n; j++)
            {
                if (vcopy[j] != 0)
                {
                    sameZera = false;
                }
            }

            if (sameZera)
            {
                return true;
            }
        }
        
    }
    
    return false;
}

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

    int zz;

    cin >> zz;
    for (int z = 0; z < zz; z++)
    {
        if (solve())
        {
            cout << "TAK" << '\n';
        }
        else
        {
            cout << "NIE" << '\n';
        }
        
    }
    
    return 0;
}