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
#include <cstdio>
#include <iostream>
#include <algorithm>
#include <cstring>
#include <vector>
#include <set>
#include <map>
#include <cmath>
#include <list>
#include <ctime>
#include <sstream>
#include <queue>
#include <stack>
#include <bitset>
#include <unordered_set>
#include <unordered_map>
using namespace std;
typedef vector<int> vi;
typedef pair<int,int> pii;
typedef long long ll;
typedef short int sint;
#define FOR(x, b, e) for(int x=(b); x<=(e); ++x)
#define FORD(x, b, e) for(int x=((int)(b))-1; 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
#define mp(x,y) make_pair(x,y)
#define DEBUG 1
#define debug(x) {if (DEBUG)cerr <<#x <<" = " <<x <<endl; }
#define debugv(x) {if (DEBUG) {cerr <<#x <<" = "; FOREACH(it, (x)) cerr <<*it <<", "; cout <<endl; }}
#define REMAX(a,b) (a)=max((a),(b));
#define REMIN(a,b) (a)=min((a),(b));
#define wez(n) int (n); scanf("%d",&(n));
#define wez2(n,m) int (n),(m); scanf("%d %d",&(n),&(m));

const int N = 101010;
pii w[N], h[N];
int n;

int main() {
	wez(t)
	while (t--) {
		scanf("%d", &n);
		scanf("%d %d %d %d", &w[0].ST, &w[0].ND, &h[0].ST, &h[0].ND);
		int mw1 = w[0].ST, mw2 = w[0].ND, mh1 = h[0].ST, mh2 = h[0].ND;
		FOR(i, 1, n-1) {
			scanf("%d %d %d %d", &w[i].ST, &w[i].ND, &h[i].ST, &h[i].ND);
			REMIN(mw1, w[i].ST)
			REMAX(mw2, w[i].ND)
			REMIN(mh1, h[i].ST)
			REMAX(mh2, h[i].ND)
		}
		bool isRes = false;
		REP(i, n) {
			if (mw1 == w[i].ST && mw2 == w[i].ND && mh1 == h[i].ST && mh2 == h[i].ND) {
				isRes = true;
			}
		}
		printf("%s\n", isRes ? "TAK" : "NIE");
	}
	return 0;
}