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
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>

using namespace std;

#define JOIN_(X, Y) X##Y
#define JOIN(X, Y) JOIN_(X, Y)
#define TMP JOIN(tmp, __LINE__)
#define PB push_back
#define SZ(x) int((x).size())
#define REP(i, n) for (int i = 0, TMP = (n); i < TMP; ++i)
#define FOR(i, a, b) for (int i = (a), TMP = (b); i <= TMP; ++i)
#define FORD(i, a, b) for (int i = (a), TMP = (b); i >= TMP; --i)

#ifdef DEBUG
#define DEB(x) (cerr << x)
#else
#define DEB(x)
#endif

typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> pii;
typedef unsigned int uint;

const int INF = 1e9 + 9;

ostream &operator<<(ostream &os, const pair<int, int> &p) {
    os << "(" << p.first << ", " << p.second << ")";
    return os;
}

template <typename T> ostream &operator<<(ostream &os, const vector<T> &vec) {
    os << "[";
    for (int i = 0; i < SZ(vec); ++i) {
        os << vec[i];
        if (i != SZ(vec) - 1) {
            os << ", ";
        }
    }
    os << "]";
    return os;
}

int count_connected_components(const vi &t) {
    int result = 0;
    bool prev = false;
    for (int x : t) {
        if (x) {
            if (prev) {
                // Dalszy ciag CC
            } else {
                // Nowy CC
                ++result;
                prev = true;
            }
        } else {
            prev = false;
        }
    }
    return result;
}

vi extract_component(const vi &t) {
    vi result;
    for (int x : t) {
        if (x) {
            result.PB(x);
        }
    }
    return result;
}

bool find_path(const vector<pii> &parts, int start) {
    DEB("find_path start=" << start << "\n");
    int x = start;
    for (const auto &[a, b] : parts) {
        DEB("  x=" << x << " a=" << a << " b=" << b << "\n");
        if (x - 1 == a) {
            x = b;
        } else if (x - 1 == b) {
            x = a;
        } else if (x + 1 == a) {
            x = b;
        } else if (x + 1 == b) {
            x = a;
        } else {
            return false;
        }
    }
    return true;
}

bool check(vi t) {
    int n = SZ(t);
    vector<pii> parts;
    FORD(i, n - 1, 1) {
        int take = min(t[i], t[i - 1]);
        if (take > 0) {
            t[i] -= take;
            t[i - 1] -= take;
            parts.emplace_back(i - 1, i);
        }
    }
    sort(parts.begin(), parts.end());
    DEB("parts=" << parts << "\n");
    int cc = count_connected_components(t);
    DEB("cc=" << cc << "\n");
    if (cc == 0) {
        return find_path(parts, 0) or find_path(parts, 1);
    }
    if (cc != 1) {
        return false;
    }
    vi comp = extract_component(t);
    DEB("comp=" << comp << "\n");
    if (SZ(comp) != 1) {
        return false;
    }
    if (cc == 1) {
        if (t[0] == 1) {
            return find_path(parts, 0);
        }
        if (t[1] == 1) {
            return find_path(parts, 1);
        }
    }
    return false;
}

bool solve() {
    int n;
    cin >> n;
    vi t(n);
    REP(i, n) { cin >> t[i]; }
    int cc = count_connected_components(t);
    if (cc > 1) {
        return false;
    }
    vi component = extract_component(t);
    DEB("component:  " << component << "\n");

    return check(component);
}

void inline one() { cout << (solve() ? "TAK" : "NIE") << "\n"; }

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    int z;
    cin >> z;
    while (z--)
        one();
}