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
#include <iostream>
#include <sstream>
#include <fstream>
#include <string>
#include <vector>
#include <queue>
#include <algorithm>
#include <map>
#include <set>

using namespace std;

typedef long long LL;

#define MAX(a, b) ((a) > (b) ? (a) : (b))
#define MIN(a, b) ((a) < (b) ? (a) : (b))
#define ABS(val) ((val) < 0 ? -(val) : (val))

#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 VAR(v, n) __typeof(n) v = (n)
#define ALL(c) (c).begin(), (c).end()
#define SIZE(x) ((int)(x).size())
#define FOREACH(i, c) for(VAR(i, (c).begin()); i != (c).end(); ++i)
#define PB push_back
#define ST first
#define ND second

	
int main() {
	
	int t;	
	scanf("%d", &t);
	REP(i, t)
	{
		int n;
		scanf("%d", &n);
		int w1 = 2e9; 
		int w2 = -1;
		int h1 = 2e9;
		int h2 = -1;
		bool maj = false;
		REP(j, n)
		{
			int w1t, w2t, h1t, h2t;
			int w1n, w2n, h1n, h2n;
			scanf("%d %d %d %d\n", &w1n, &w2n, &h1n, &h2n);
			w1t = MIN(w1, w1n);
			w2t = MAX(w2, w2n);
			h1t = MIN(h1, h1n);
			h2t = MAX(h2, h2n);

			if(w1n == w1t && w2n == w2t && h1n == h1t && h2n == h2t)
			{
				maj = true; //new
			}
			else
			if(w1 == w1t && w2 == w2t && h1 == h1t && h2 == h2t)
			{
				//cont
			}
			else
			{
				maj = false;
			}
		
			w1 = w1t;
			w2 = w2t;
			h1 = h1t;
			h2 = h2t;	
		}
	
		if(maj)
		{
			printf("TAK\n");
		}
		else
		{
			printf("NIE\n");
		}
	}
	return 0;
}