//	Michał Wiatrowski

#include <iostream>
#include <algorithm>

using namespace std;

int main() {
	ios_base::sync_with_stdio(false);

	int t;
	cin >> t;

	for (int test = 0; test < t; ++test) {
		int n;
		cin >> n;

		int wmin, wmax, hmin, hmax;
		int w1, w2, h1, h2;

		bool ok = true;

		cin >> wmin >> wmax >> hmin >> hmax;

		for (int i = 1; i < n; ++i) {
			cin >> w1 >> w2 >> h1 >> h2;
			if (w1 < wmin || w2 > wmax || h1 < hmin || h2 > hmax) {
				if (w1 <= wmin && w2 >= wmax && h1 <= hmin && h2 >= hmax)
					ok = true;
				else
					ok = false;

				wmin = min(w1, wmin);
				wmax = max(w2, wmax);
				hmin = min(h1, hmin);
				hmax = max(h2, hmax);
			}
		}

		if (ok)
			cout << "TAK" << endl;
		else
			cout << "NIE" << endl;

	}

	return 0;
}