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

using namespace std;

typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef pair<int, int> pii;

#define FOR(x, b, e) for(int x = (b); x <= (e); ++(x))
#define FORD(x, b, e) for(int x = (b); x >= (e); --(x))
#define REP(x, n) for(int x = 0; x < (n); ++x)
#define ALL(c) (c).begin(), (c).end()
#define SIZE(x) ((int)(x).size())
#define FOREACH(a, b) for (auto&a : (b))
#define PB push_back
#define PF push_front
#define ST first
#define ND second
#define DBG(vari) cerr<<#vari<<" = "<<(vari)<<endl

template <typename T>
std::ostream& operator<<(std::ostream &output, const vector<T> &vec)
{
    output << "[";
    FOREACH(x, vec) output << x << ", ";
    output << "]";
    return output;
}

template <typename T, typename U>
std::ostream& operator<<(std::ostream &output, const pair<T,U> &p)
{
    output << "(";
    output << p.ST << ", " << p.ND;
    output << ")";
    return output;
}


int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);

  int t; cin >> t;
  while (t--) {
    int n; cin >> n; 
    vi a;

    bool nz=false;
    REP(i, n) {
      int x; cin >> x;
      if (x != 0 || nz) {
        nz = true;
        a.PB(x);
      }
    }

    while (SIZE(a) > 0 && a[SIZE(a)-1] == 0)
      a.pop_back();

    bool bylo = false;
    bool prawo;


    REP(i, SIZE(a)) {
      if (a[i] == 0) {
        cout << "NIE" << endl;
        goto next_case;

      }
    }

    while (SIZE(a) > 2) {
      if (a[SIZE(a)-1] > a[SIZE(a)-2]) {
        cout << "NIE" << endl;
        goto next_case;
      }
      else if (a[SIZE(a)-1] == a[SIZE(a)-2]) {
        if (bylo) {
          if (!prawo) {
            cout << "NIE" << endl;
            goto next_case;
          }
        }

        a.pop_back();
        a.pop_back();
        bylo = true;
        prawo = true;
      }
      else
      {
        a[SIZE(a)-2] -= a[SIZE(a)-1];
        a.pop_back();
        prawo = !prawo;
      }
    }

    if (SIZE(a) == 2 && abs(a[0]-a[1]) <= 1 && (!bylo || ((a[1] > a[0])==prawo) || (a[1] == a[0]))) {
      cout << "TAK" << endl;
    }
    else if (SIZE(a) == 1 && a[0] == 1) {
      cout << "TAK" << endl;
    }
    else if (SIZE(a) == 0) {
      cout << "TAK" << endl;
    }
    else
    {
      cout << "NIE" << endl;
    }
    
    next_case:;
  }

}