#include <bits/stdc++.h>

using namespace std;

#define _DEBUG
#ifdef _DEBUG
template<typename T1, typename T2> auto& operator<<(ostream& o, pair<T1, T2> a) { return o << "(" << a.first << ", " << a.second << ")"; }
template<typename T, typename OS> auto& operator<<(OS& o, T a) { o << "{"; for(auto b : a) o << b << ", "; return o << "}"; }
#define dbg(x...) cerr << "[" #x "]: ", [](auto... args) { ((cerr << args << ", "),...) << "\n"; }(x)
#else
#define dbg(...)
#endif

#define sz(x) ((int)(x).size())
#define all(x) (x).begin(), (x).end()
#define F first
#define S second

using ll = long long;
using ld = long double;
using pll = pair<ll,ll>;
using vi = vector<int>;

bool bruteRec(int i, vector<int>& vs, int sum = 0) {
  if(vs[i] == 0) {
    return false;
  }
  vs[i]--;

  sum--;
  if(sum == 0) {
    vs[i]++;
    return true;
  }
  if(sum < 0) {
    return false;
  }

  if(i > 0 && bruteRec(i - 1, vs, sum)) {
    vs[i]++;
    return true;
  }
  if(i < vs.size() - 1 && bruteRec(i + 1, vs, sum)) {
    vs[i]++;
    return true;
  }

  vs[i]++;
  return false;
}

bool brute(int n, vector<int> vs) {
  int sum = 0;
  for(auto v : vs) {
    sum += v;
  }

  for(int start = 0; start < n; start++) {
    if(bruteRec(start, vs, sum)) {
      return true;
    }
  }
  return false;
}

bool solve(int n, vector<int> vs) {
  while(vs.back() == 0) {
    vs.pop_back();
    n--;
  }

  vector<int> tmp;
  for(int i = 0; i < vs.size(); i++) {
    if(vs[i] != 0 || !tmp.empty()) {
      tmp.push_back(vs[i]);
    }
  }
  vs = tmp;
  n = vs.size();

  bool prefixing = false;
  bool weak = false;
  bool prevM = false;
  for(int i = 0; i < n;) {    
    if(i + 1 < n && vs[i] == vs[i + 1]) {
      if(vs[i] == 0) {
        return false;
      }
      i += 2;
      prefixing = true;
      continue;
    }

    if(prefixing) {
      vs[i]--;
      if(i + 1 == n) {
        return vs[i] == 0;
      }
      if(vs[i] < 0) {
        return false;
      }
      if(vs[i + 1] < vs[i]) {
        return false;
      }
      if(vs[i + 1] == vs[i]) {
        return n - i == 2;
      }
      vs[i + 1] -= vs[i];
      i++;
    }
    else {
      if(i + 1 == n) {
        return vs[i] <= 1;
      }
      if(vs[i] > vs[i + 1]) {
        if(n - i > 2) {
          return false;
        }
        return vs[i] - vs[i + 1] == 1;
      }
      if(vs[i] < vs[i + 1]) {
        vs[i + 1] -= vs[i];
        i++;
      }
    }
  }
  return true;
}

void solve() {
  int n;
  cin >> n;
  vector<int> vs(n);
  for(auto& v : vs) {
    cin >> v;
  }
  cout << (solve(n, vs) ? "TAK" : "NIE");
}

void test(string inp, string outp) {
  std::ifstream in(inp);
  std::ifstream out(outp);
  int t;
  in >> t;
  while(t--) {
    int n;
    in >> n;
    vector<int> vs(n);
    for(auto& v : vs) {
      in >> v;
    }
    auto ans = (solve(n, vs) ? "TAK" : "NIE");
    string ok;
    out >> ok;
    if(ans != ok) {
      cout << "WRONG" << endl;
      assert(false);
    }
    else {
      cout << "OK" << endl;
    }
  }
}

void test() {
  static std::mt19937 gen(123);
  int n = std::uniform_int_distribution<int>(1, 9)(gen);
  std::vector<int> vs(n);
  int sum = 0;
  while(sum == 0 || sum >= 25) {
    sum = 0;
    for(auto& v : vs) {
      v = std::uniform_int_distribution<int>(0, 15)(gen);
      sum += v;
    }
  }

  auto ans1 = solve(n, vs);
  auto ans2 = brute(n, vs);
  if(ans1 != ans2) {
    cout << "OH NO!" << endl;
    ans1 = solve(n, vs);
    ans1 = solve(n, vs);
    ans1 = solve(n, vs);
    ans2 = brute(n, vs);
    ans2 = brute(n, vs);
    ans2 = brute(n, vs);
  }

}

int main() {
  //for(int i = 0; i < 1000000; i++) {
  //  test();
  //}
  //return 0;
  //for(int i = 1; i <= 1000; i++ ) {
  //  test("wyltests2/" + std::to_string(i) + ".in", "wyltests2/" + std::to_string(i) + ".out");
  //}  
  //return 0;

  cin.tie(0)->sync_with_stdio(0);
  int t;
  cin >> t;
  while(t--) {
    solve();
    cout << "\n";
  }
  return 0;
}