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
132
133
134
#include <iostream>
#include <vector>

bool checkIfHoles(const std::vector<long long>& A){
    bool zeroAfterDigit = false;
    bool digitOccured = false;
    for (long long a = 0; a < A.size();a++){
        if (A[a] == 0) {
            if (digitOccured) {
                zeroAfterDigit = true;
            }
        }
        else if (A[a] >= 1) {
            if (zeroAfterDigit) {
                return false;
            }
            digitOccured = true;
        }
    }
    return true;
}

bool checkIfCorrect(const std::vector<long long>& A){
    bool zeroAfterDigit = false;
    bool digitOccured = false;
    for (long long a = 0; a < A.size();a++){
        if (A[a] == 0) {
            if (digitOccured) {
                zeroAfterDigit = true;
            }
        }
        else if (A[a] == 1) {
            if (zeroAfterDigit) {
                return false;
            }
            digitOccured = true;
        }
        else if (A[a] > 1) {
            return false;
        }
    }
    return true;
}

bool decide(std::vector<long long>& A, long long N){
    for (long long n=0;n<N-1;n++){
        if (A[n] == 0 && A[n+1] ==0){
            continue;
        }
        if (A[n] == A[n+1]) {
            A[n] = 0;
            A[n+1] = 0;

            if (n+2 == N-1){
                if (A[n+2] == 1) {
                    return true;
                }
                return false;
            }
            A[n+2]--;
            A[n+3]--;
            if (n+3 == N-1){
                if (A[n+3] > A[n+2]) {
                    return false;
                }
                if (A[n+3] == A[n+2]) {
                    return true;
                }

                return (A[n+2] - A[n+3]) == 1;
            }
            n++;
        }
        else if (A[n] > A[n+1]) {
            A[n] = A[n] - A[n+1];
            A[n+1] = 0;

            return checkIfCorrect(A);
        }
        else {
            A[n+1] = A[n+1] - A[n];
            A[n] = 0;
            if (n>0) {
                if (A[n-1] == 0) {
                    A[n+1]--;
                }
            }
        }
    }
    return checkIfCorrect(A);
}
int main()
{
    long long T, N;
    std::cin >> T;
    for (long long t = 0; t<T;t++){
        std::cin >> N;
        std::vector<long long> A(N, 0);

        long long size = 0;
        for (long long n=0;n<N;n++){
            long long a;
            std::cin >> a;
            A[n] = a;
            if (a>0){
                size = n+1;
            }
        }
        if (N == 1) {
            if (A[0] > 1) {
                std::cout << "NIE" << std::endl;
            }
            else
            {
                std::cout << "TAK" << std::endl;
            }
        }
        else if (!checkIfHoles(A)){
            std::cout << "NIE" << std::endl;
        }
        else{
            bool decision = decide(A, size);
            if (decision){
                std::cout << "TAK" << std::endl;
            }
            else {
                std::cout << "NIE" << std::endl;
            }

        }
    }

    return 0;
}