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
#include <iostream>

using namespace std;

struct Offer
{
	int minW;
	int maxW;
	int minH;
	int maxH;
};

void solveTestCase();

int main() {

	int t = 0;
	cin >> t;

	for (int i = 0; i < t; i++)
	{
		solveTestCase();
	}

	return 0;
}


void solveTestCase()
{
	int n = 0;
	cin >> n;

	Offer* offers = new Offer[n];

	int minMinW = 100001;
	int maxMaxW = 0;
	int minMinH = 100001;
	int maxMaxH = 0;

	int numberOfMajorizers = 0;

	for (int i = 0; i < n; i++)
	{
		cin >> offers[i].minW;
		if (offers[i].minW < minMinW)
			minMinW = offers[i].minW;

		cin >> offers[i].maxW;
		if (offers[i].maxW > maxMaxW)
			maxMaxW = offers[i].maxW;

		cin >> offers[i].minH;
		if (offers[i].minH < minMinH)
			minMinH = offers[i].minH;

		cin >> offers[i].maxH;
		if (offers[i].maxH > maxMaxH)
			maxMaxH = offers[i].maxH;
	}

	for (int i = 0; i < n; i++)
	{
		if (offers[i].minW == minMinW && offers[i].maxW == maxMaxW
				&& offers[i].minH == minMinH && offers[i].maxH == maxMaxH)
		{
			numberOfMajorizers++;
		}
	}

	cout << (numberOfMajorizers > 0 ? "TAK" : "NIE") << endl;

	delete[] offers;
}