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
#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

bool check(vector<int> v) {
  if(v.size() == 1) return v[0] == 1;
  v[0]--;
  for(int i = 1; i < v.size(); i++) {
    v[i] -= v[i - 1];
    if(i + 1 < v.size()) v[i]--;
    if(v[i] < 0) return 0;
  }
  return v.back() <= 1;
}

void solve() {
  int n;
  cin >> n;
  vector<int> v(n);
  int mn = 1e9, mx = 0;
  for(int i = 0; i < n; i++) {
    cin >> v[i];
    if(v[i]) {
      mn = min(mn, i);
      mx = max(mx, i);
    }
  }
  v = vector<int>(v.begin() + mn, v.begin() + mx + 1);
  bool f = 0;
  for(int rep = 0; rep < 2; rep++) {
    reverse(all(v));
    if(check(v)) f = 1;
    v[0]++;
    if(check(v)) f = 1;
    v[0]--;
  }
  if(f) cout << "TAK\n";
  else cout << "NIE\n";
}

int main() {
  cin.tie(0)->sync_with_stdio(0);

  int t;
  cin >> t;
  while(t--) solve();
}