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
#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <algorithm>
#include <vector>
#include <cmath>
#include <map>
#include <queue>
#include <set>
#include <numeric>
#include <stack>
#include <iomanip>
using namespace std;
using ll = long long int;
#define debug(x) cout << #x << " = " << x << endl;
void solve()
{
    int n;
    cin >> n;
    deque<int>v;
    for (int i = 0; i < n; i++)
    {
        int x;
        cin >> x;
        v.push_back(x);
    }
    while (v.front() == 0)
    {
        v.pop_front();
    }
    while (v.back() == 0)
    {
        v.pop_back();
    }
    n = v.size();
    for (int i = 0; i < n; i++)
    {
        if (v[i] == 0)
        {
            cout << "NIE" << "\n";
            return;
        }
    }
    if (n == 1 && v[0] == 1)
    {
        cout << "TAK" << "\n";
        return;
    }
    else if (n == 1)
    {
        cout << "NIE" << "\n";
        return;
    }
    bool odp = false;
    deque<int>help = v;
    help[0]--;
    for (int i = 1; i < n-1; i++)//zaczalem po lewej
    {
        help[i] -= (help[i - 1]+1);
        if (help[i] < 0)
        {
            break;
        }
        if ( (i==n-2) && (help[n - 1] == help[n - 2] || (help[n - 1] == help[n - 2] + 1)))
        {
            odp = true;
        }
    }
    
    help = v;
    help[n-1]--;
    for (int i = n-2; i > 0; i--)//zaczalem po prawej
    {
        help[i] -= (help[i + 1] + 1);
        if (help[i] < 0)
        {
            break;
        }
        if ((i==1) && (help[0] == help[1] || (help[0] == help[1] + 1)))
        {
            odp = true;
        }
    }
    if (odp)
    {
        cout << "TAK" << "\n";
        return;
    }
    //zaczalem w srodku
    help = v;
    for (int i = 1; i < n - 1; i++)
    {
        if (help[i] == 0)
            continue;
        help[i] -= (help[i - 1] + 1);
        if (help[i] < 0)
        {
            break;
        }
        if ((i==n-2) && (help[n - 1] == help[n - 2] || (help[n - 1] == help[n - 2] + 1)))
        {
            odp = true;
        }
    }
    if (odp)
    {
        cout << "TAK" << "\n";
        return;
    }
    else
    {
        cout << "NIE" << "\n";
        return;
    }
}

int main()
{
    ios::sync_with_stdio(false);
    int t;
    cin >> t;
    while (t--)
    {
    solve();
    }
    return 0;
}