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
#include <iostream>
#include <cstdio>
#include <vector>
using namespace std;

const int MX = 1000010;
int T[MX];
int D[2][3];
int go()
{
    int n;
    scanf("%d", &n);
    T[n+1]=0;
    for (int i=1; i<=n; i++)
    {
        scanf("%d",&T[i]);
    }

    for (int i = 1; i <= n; i++)
    {
        int nb = T[i-1] + T[i+1];
        if (T[i] > nb + 1)
        {
            cout << "NIE" << endl;
            return 0;
        }
        if (T[i] == nb + 1)
        {
            for (int j = 1; j <=n; j++)
            {
                if (j != i-1 && j != i && j != i + 1)
                {
                    if (T[j] > 0)
                    {
                        cout << "NIE" << endl;
                        return 0;
                    }
                }
            }
            cout << "TAK" << endl;
            return 0;

        }
        if (T[i] == nb)
        {
            bool ok1 = true, ok2 = true;
            for (int j = 1; j < i - 1; j++)
                ok1 &= (T[i] == 0);
            for (int j = i + 2; j <= n; j++)
                ok2 &= (T[i] == 0);
            if (!ok1 && !ok2)
            {
                cout << "NIE" << endl;
                return 0;
            }
        }
    }
    long long res = 0;
    for (int i = 1; i <= n; i++)
    {
        if (i % 2) res += T[i];
        else res -= T[i];

    }

    cout << (abs(res) <= 1 ? "TAK" : "NIE") << endl;
    return 0;
}

int main()
{
    int t;
    scanf("%d", &t);

    while (t--)
    {
        go();
    }

    return 0;
}