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
#include <bits/stdc++.h>

#define ll long long
#define ve vector
#define fi first
#define se second
#define ld long double
#define all(x) x.begin(), x.end()

using namespace std;

typedef pair<int, int> pii;

int find(ve<int> v)
{
    int n = v.size();
    for (int i = 1; i < n; i++)
    {
        int mn = min(v[i - 1], v[i]);
        v[i - 1] -= mn;
        v[i] -= mn;
    }
    int pos = -2;
    ll sum = 0;
    for (int i = 0; i < n; i++)
    {
        sum += v[i];
        if (v[i] == 1)
            pos = i;
    }
    if (sum > 1)
        return -1;
    return pos;
}

bool check(ve<int> &v, int l, int r)
{
    ll sum = 0;
    for (int i = l + 1; i <= r; i++)
    {
        if (!v[i])
            return 0;
        v[i]--;
        if (v[i] < v[i - 1] && i != r)
            return 0;
        int mn = min(v[i - 1], v[i]);
        v[i - 1] -= mn;
        v[i] -= mn;
    }
    for (int i = l; i <= r; i++)
        sum += v[i];
    return sum <= 1;
}

bool check2(ve<int> v, int s)
{
    for (int i = s; i >= 0; i--)
    {
        v[i]--;
    }
    return check(v, 0, v.size() - 1);
}

void solve()
{
    int n;
    cin >> n;
    ve<int> v(n);
    for (auto &i : v)
        cin >> i;
    reverse(all(v));
    while (v.back() == 0)
        v.pop_back();
    reverse(all(v));
    while (v.back() == 0)
        v.pop_back();
    n = v.size();
    if (*min_element(all(v)) == 0)
    {
        cout << "NIE\n";
        return;
    }
    int s = find(v);
    if (s == -2)
    {
        s = 0;
        v[0]--;
        s = find(v);
        v[0]++;
    }
    if (s == -1)
    {
        cout << "NIE\n";
        return;
    }
    bool ok1 = check2(v, s);
    reverse(all(v));
    if (ok1 || check2(v, n - 1 - s))
        cout << "TAK\n";
    else
        cout << "NIE\n";
}

signed main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    int T = 1;
    cin >> T;
    while (T--)
        solve();
}