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
127
128
129
130
131
132
133
134
135
136
#include <bits/stdc++.h>
using namespace std;

#define loop(i, a, b) for(int i = a; i <= b; i++)
#define loop_rev(i, a, b) for(int i = a; i >= b; i--)
#define all(x) x.begin(), x.end()
#define sz(x) int(x.size())
#define pb push_back

using ll = long long;
#define int ll

bool solve(vector<int> const& a, int n);

signed main() {
  cin.tie(0)->sync_with_stdio(0);
  #ifndef LOCAL
    int t; cin >> t;
    while(t--) {
      int n; cin >> n; vector<int> a(n + 1);
      loop(i, 1, n) cin >> a[i];
      if(solve(a, n)) {
        cout << "TAK\n";
      }
      else {
        cout << "NIE\n";
      }
    }
  #else
    constexpr int n = 10;
    int res = 0, cnt = 0;
    vector<int> a(n + 1);
    loop(ma_or, 0, 1073741823) {
      int ma = ma_or;
      loop(i, 1, n) {
        a[i] = (ma % 8) + 1;
        ma /= 8;
      }
      if(solve(a, n)) {
        ++cnt;
        res ^= ma_or;
      }
      if(ma_or % 1'000'000 == 0) {
        cerr << "done: " << ma_or << '\n';
      }
    }
    cerr << "xor: " << res << '\n';
    cerr << cnt << '\n';
    assert(res == 1073741823);
    assert(cnt == 15136270);
    cerr << "OK!\n";
  #endif
}

bool solve(vector<int> const& a, int n) {
  int fi = 1, la = n;
  while(a[fi] == 0) ++fi;
  while(a[la] == 0) --la;

  loop(i, fi, la) if(a[i] == 0) {
    return false;
  }

  if(fi == la) {
    return (a[fi] == 1);
  }

  constexpr pair<int, int> INVALID = { 2e9, (-2e9) };

  vector<pair<int, int>> dp(3, INVALID);
  dp[0] = { a[fi], a[fi] };

  auto has = [&](pair<int, int> range, int val) -> bool {
    return val >= range.first && val <= range.second;
  };


  auto add = [&](pair<int, int> &dest, pair<int, int> new_add) -> void {
    if(new_add.first > new_add.second) {
      new_add = INVALID;
    }
    dest.first = min(dest.first, new_add.first);
    dest.second = max(dest.second, new_add.second);
  };


  loop(l, fi + 1, la) {
    if(l != la) {
      vector<pair<int, int>> new_dp(3, INVALID);
      loop(i, 0, 2) {
        if(dp[i] == INVALID) continue;
        int new_cnt = (a[l] - i);
        auto [ x1, y1 ] = dp[i];
        int x = new_cnt - y1;
        int y = new_cnt - x1;
        x = max(x, 0LL);
        if(x > y) continue;
        if(i == 0 && x == 0) {
          add(new_dp[i], { x + 1, y });
        }
        else {
          add(new_dp[i], { x, y });
        }
        if(i < 2) {
          int range_x = max(x1, 1LL);
          int range_y = y1;
          int x_start = new_cnt - range_x;
          int y_end = new_cnt - range_y;
          add(new_dp[i + 1], { max(0LL, x_start), y_end });
        }
        if(i < 1) {
          int range_x = max(x1, 2LL);
          int range_y = y1;
          int x_start = new_cnt - range_x;
          int y_end = new_cnt - range_y;
          add(new_dp[i + 2], { max(0LL, x_start), y_end });
        }
      }
      dp.swap(new_dp);
    }
    else {
      if(has(dp[0], (a[l] + 1)) || has(dp[0], a[l]) || has(dp[0], a[l] - 1)) {
        return true;
      }
      if(has(dp[1], a[l]) || has(dp[1], a[l] - 1)) {
        return true;
      }
      if(has(dp[2], a[l] - 1)) {
        return true;
      }
    }
  }

  return false;

}