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
#include <bits/stdc++.h>
using namespace std;
#define endl "\n"
#define mp make_pair
#define st first
#define nd second
#define pii pair<int, int>
#define vi vector<int>
#define pb push_back
#define _upgrade ios_base::sync_with_stdio(0), cout.setf(ios::fixed), cout.precision(10), cin.tie(0), cout.tie(0);
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define fwd(i, a, b) for (int i = (a); i < (b); ++i)
#define trav(a, x) for (auto &a : x)
#define all(c) (c).begin(), (c).end()
#define sz(X) (int)((X).size())
typedef long double ld;
typedef unsigned long long ull;
typedef long long ll;
#ifdef LOCAL
ostream &operator<<(ostream &out, string str) {
   for (char c : str)
      out << c;
   return out;
}
template <class L, class R> ostream &operator<<(ostream &out, pair<L, R> p) { return out << "(" << p.st << ", " << p.nd << ")"; }
template <class L, class R, class S> ostream &operator<<(ostream &out, tuple<L, R, S> p) {
   auto &[a, b, c] = p;
   return out << "(" << a << ", " << b << ", " << c << ")";
}
template <class T> auto operator<<(ostream &out, T a) -> decltype(a.begin(), out) {
   out << '{';
   for (auto it = a.begin(); it != a.end(); it = next(it))
      out << (it != a.begin() ? ", " : "") << *it;
   return out << '}';
}
void dump() { cerr << "\n"; }
template <class T, class... Ts> void dump(T a, Ts... x) {
   cerr << a << ", ";
   dump(x...);
}
#define debug(...) cerr << "[" #__VA_ARGS__ "]: ", dump(__VA_ARGS__)
#else
#define debug(...) 42
#endif

bool is_good(vector<int> X) {
   // debug(X);
   X.push_back(0);
   rep(i, sz(X) - 1) {
      // debug(X);
      X[i + 1] -= X[i];
      if (X[i + 1] < 0)
         return false;
   }
   return true;
}

bool solve(vector<int> X) {
   for (int i = 0; i < 2; i++, reverse(all(X)))
      while (X.back() == 0)
         X.pop_back();
   int n = sz(X);

   if (count(all(X), 0))
      return false;

   for (auto &y : X)
      y--;

   rep(i, 2) rep(j, 2) {
      auto Y = X;
      if (i and n > 1 and Y[1] > 0)
         Y[1]--;
      if (j and n > 1 and Y[n - 2] > 0)
         Y[n - 2]--;
      debug(Y);
      if (is_good(Y))
         return true;
   }

   return false;
}

void solve() {
   int n;
   cin >> n;
   vector<int> X(n);
   for (auto &x : X)
      cin >> x;
   bool res = solve(X);
   cout << (res ? "TAK" : "NIE") << endl;
}

void test() {
   int res = 0;
   int cnt = 0;
   rep(S, 1 << 24) if (S) {
      if (S % 1000 == 0)
         cerr << S << endl;

      vector<int> X(8);
      auto sp = S;
      for (auto &x : X) {
         x = sp & 7;
         sp /= 8;
      }
      if (solve(X))
         cnt++, res ^= S;
   }
   cout << cnt << " " << res << endl;
   exit(0);
}

int32_t main() {
   _upgrade;
   // test();
   int Z;
   cin >> Z;
   while (Z--)
      solve();
}