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
// PA2025, @mjm, r2b-wyl

#include <cstdio>
#include <vector>
#include <set>
#include <algorithm>
#include <functional>
using namespace std;
using lol = long long;
inline int nextInt() { int n; scanf("%d", &n); return n; }
inline lol myAbs(lol n) { return n >= 0 ? n : -n; }

const int N = 1000000 + 9;
int n;
int a[N];

struct Item {
	int idx;
	int mode;
	int delta;
	bool operator<(const Item& oth) const {
		if (idx != oth.idx)
			return idx < oth.idx;
		if (mode != oth.mode)
			return mode < oth.mode;
		return delta < oth.delta;
	}
	void show() const {
		printf("idx %d, mode %d, delta %d\n", idx, mode, delta);
	}
};

bool solve() {
	int be = 0;
	while (0 == a[be]) ++be;
	int en = n - 1;
	while (0 == a[en]) --en;

	lol cnt[2];
	cnt[0] = cnt[1] = 0;
	for (int i = be; i <= en; ++i) {
		if (0 == a[i]) return false;
		cnt[i % 2] += a[i];
	}
	if (myAbs(cnt[0] - cnt[1]) > 1) return false;
	if (be == en) return true;
	if (be + 1 == en) return true;

	set<Item> s;
	s.insert({ be, 0, 0 });

	while (!s.empty()) {
		int idx = s.begin()->idx;
		int mode = s.begin()->mode;
		int delta = s.begin()->delta;
		s.erase(s.begin());
		int cnt = a[idx] - delta;

		if (en == idx) {
			if (0 == mode) if (2 == cnt) return true;
			if (1 == mode) if (1 == cnt) return true;
			if (2 == mode) if (1 == cnt) return true;
			continue;
		}

		if (0 == mode) {
			if (cnt < 1) continue;
			s.insert({ idx + 1, 0, cnt });
			s.insert({ idx + 1, 1, cnt - 1 });
			if (cnt >= 2)
				s.insert({ idx + 1, 2, cnt - 2 });
		}

		if (1 == mode) {
			if (cnt < 1) continue;
			s.insert({ idx + 1, 1, cnt - 1 });
			if (cnt >= 2)
				s.insert({ idx + 1, 2, cnt - 2 });
		}

		if (2 == mode) {
			if (cnt < 2) continue;
			s.insert({ idx + 1, 2, cnt - 2 });
		}
	}

	return false;
}

int main() {
	int TC = nextInt();
	for (int tc = 0; tc < TC; ++tc) {
		n = nextInt();
		for (int i = 0; i < n; ++i)
			a[i] = nextInt();
		bool res = solve();
		printf("%s\n", res ? "TAK" : "NIE");
	}
	return 0;
}