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
#include <iostream>
#include <algorithm>
#include <cstring>

using namespace std;

const int N = 1e6 + 7;
int tab[N];
int meh[N];

bool go(int a, int b, int n) {
    while (true) {
        tab[a]--;
        if (tab[a - 1] != 0 && (tab[a - 1] == tab[a - 2] + tab[a])) {
            a--;
        } else if (tab[a + 1] != 0 && (tab[a + 1] == tab[a + 2] + tab[a])) {
            a++;
        } else if (tab[a - 1] != 0) {
            a--;
        } else if (tab[a + 1] != 0) {
            a++;
        } else {
            if (b != -1 && a != b)
                return false;
            for (int i = 1; i <= n; i++) {
                if (tab[i] != 0)
                    return false;
            }
            return true;
        }
    }
}

bool f() {
    int n;
    cin >> n;
    for (int i = 1; i <= n; i++) {
        cin >> tab[i];
    }
    tab[n + 1] = 0;
    int a = -1, b = -1;
    for (int i = 1; i <= n; i++) {
        if (tab[i] == 0)
            continue;
        if (tab[i] > tab[i - 1] + tab[i + 1] + 1) {
            return false;
        }
        if (tab[i] == tab[i - 1] + tab[i + 1] + 1) {
            a = i;
            b = i;
            break;
        }
        if (tab[i] == tab[i - 1] + tab[i + 1]) {
            if (a == -1) {
                a = i;
            } else {
                b = i;
                break;
            }
        }
    }

    if (a != -1) {
        return go(a, b, n);
    }
    memcpy(meh, tab, N * sizeof(int));
    for (int i = 1; i <= n; i++) {
        memcpy(tab, meh, N * sizeof(int));
        if (go(i, -1, n))
            return true;
    }
    return false;
}

bool odp[10077695 + 7];

int main() {
    int t;
    cin >> t;
    for (int i = 1; i <= t; i++) {
        cout << (f() ? "TAK" : "NIE") << endl;
    }
    return 0;
}