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
129
130
131
#include <bits/stdc++.h> 
using namespace std;
#define st first
#define nd second
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
const int maxn = (1000009);
int a[maxn];

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

    int licz = 0;

    while(te--)
    {
        licz++;

        
        int N ;
        cin >> N;
        for(int i = 0 ;i < N ; i++)
        {
            cin >> a[i];
        }
        a[N] = 0;

       /* if(licz == 10077334)
        {
            cout << N << '\n';
            for(int i =0 ; i < N ; i++)cout <<a[i] << ' '; cout << '\n';
        }
        else continue;*/


        int l = 0;

        while(l < N && a[l] == 0)l++;

        if(l == N)
        {
            cout << "TAK\n";
            continue;
        }

        a[l]++;

        bool czy2 = 1;
        while(l < N-1 && a[l] > 0)
        {
            if(a[l] == 2 && czy2)
            {
                l++; continue;
            }
            if(a[l] == 1)
            {
                l++;
                czy2 = 0;
                continue;
            }

            if(czy2)
            {
                int I = min(a[l+1] , a[l]-2);
                a[l] -= I;
                a[l+1] -= I;
                if(a[l] == 2)
                {
                    l++; continue;
                }
            }
            else
            {
                int I = min(a[l+1] , a[l]-1);
                
                a[l] -= I;
                a[l+1] -= I;
                if(a[l] != 1)break;
            }

            l++;
        }

        l = 0;
        while(l < N && a[l] == 0)l++;


        bool czy = 1;
        czy2 = 1; bool czy1 = 1;
        for( ; l < N ; l++)
        {
            if(a[l] >= 3)
            {
                czy = 0;
                continue;
            }

            if(czy2)
            {
                if(a[l] == 2)continue;
                if(a[l] == 1)czy2 = 0;
                if(a[l] == 0)
                {
                    czy2 = 0 ;
                    czy1 = 0;
                }
            }
            else if(czy1)
            {
                if(a[l] == 2)czy = 0;
                if(a[l] == 1)continue;;
                if(a[l] == 0)czy1 = 0;
            }
            else
            {
                if(a[l] >= 1)czy = 0;
            }
        }


        if(czy)cout << "TAK\n";
        else cout << "NIE\n";
    }
    
    return 0;
}