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
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <cstring>
#include <cmath>
using namespace std;

typedef long long int LL;
typedef long double LD;
typedef vector<int> VI;
typedef vector<LL> VLL;
typedef vector<LD> VLD;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef vector<PII> VPII;

const int INF = 2000000001;
const LD EPS = 10e-9;

#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 FORE(i, c) for(VAR(i, (c).begin()); i != (c).end(); ++i)
#define MP make_pair
#define PB push_back
#define ST first
#define ND second
#define abs(a) ((a)<0 ? -(a) : (a))
#define max(a, b) ((a) > (b) ? (a) : (b))
#define min(a, b) ((a) < (b) ? (a) : (b))

const int MAX_N = 100005;

struct prod
{
	int wmin, wmax, hmin, hmax;
}mirrors[MAX_N];

int t, n;

int main()
{
	scanf("%d", &t);
	while(t--)
	{
		int wmin = INF, wmax = 0, hmin = INF, hmax = 0;
		scanf("%d", &n);
		REP(i, n)
		{
			scanf("%d %d %d %d", &mirrors[i].wmin, &mirrors[i].wmax, &mirrors[i].hmin, &mirrors[i].hmax);
			
			if(mirrors[i].wmin < wmin)
			{
				wmin = mirrors[i].wmin;
			}
			if(mirrors[i].hmin < hmin)
			{
				hmin = mirrors[i].hmin;
			}
			if(mirrors[i].wmax > wmax)
			{
				wmax = mirrors[i].wmax;
			}
			if(mirrors[i].hmax > hmax)
			{
				hmax = mirrors[i].hmax;
			}
		}
		
		bool ok = 0;
		REP(i, n)
		{
			if(mirrors[i].wmin == wmin && mirrors[i].hmin == hmin &&
				mirrors[i].wmax == wmax && mirrors[i].hmax == hmax)	
			{
				ok = 1;
				break;
			}
		}
		
		printf((ok ? "TAK\n" : "NIE\n"));
	}
 	//system("pause");
 	return 0;
}