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

#define rep(i, a, b) for (int i = (a); i < (b); i++)
#define all(x) begin(x), end(x)
#define sz(x) int((x).size())
using ll = long long;
using pii = pair<int, int>;
using vi = vector<int>;

#ifdef LOCAL
auto operator<<(auto& o, auto x) -> decltype(x.first, o);
auto operator<<(auto& o, auto x) -> decltype(x.end(), o) {
  o << "{";
  for (int i = 0; auto y : x) o << ", " + !i++ * 2 << y;
  return o << "}"; }
auto operator<<(auto& o, auto x) -> decltype(x.first, o) {
  return o << "(" << x.first << ", " << x.second << ")"; }
void __print(auto... x) { ((cerr << x << " "), ...) << endl; }
#define debug(x...) __print("[" #x "]:", x)
#else
#define debug(...) 2137
#endif

const int N = 1000100;
int n;
int a[N];

bool solve() {
  cin >> n;
  rep(i, 0, n) cin >> a[i];
  int l = 0; while (a[l] == 0) l++;
  int r = n - 1; while (a[r] == 0) r--;
  if (count(a + l, a + r + 1, 0)) return 0;
  while (l < r) {
    if (a[l] != a[l + 1]) {
      if (a[l] < a[l + 1]) {
        a[l + 1] -= a[l];
        a[l] = 0;
        l++;
      } else {
        if (a[l] != a[l + 1] + 1) return 0;
        rep(i, l + 2, n) if (a[i] != 0) return 0;
        return 1;
      }
    } else if (a[r] != a[r - 1]) {
      if (a[r] < a[r - 1]) {
        a[r - 1] -= a[r];
        a[r] = 0;
        r--;
      } else {
        if (a[r] != a[r - 1] + 1) return 0;
        rep(i, 0, r) if (a[i] != 0) return 0;
        return 1;
      }
    } else {
      break;
    }
  }
  if (l == r) return a[l] == 1;
  while (l < r) {
    if (a[l + 1] <= a[l] - 1) return 0;
    a[l + 1] -= a[l] - 1;
    l++;
  }
  return a[l] == 1;
}

int main() {
  cin.tie(0)->sync_with_stdio(0);
  int t;
  cin >> t;
  while (t--) cout << (solve() ? "TAK" : "NIE") << '\n';
}