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
95
96
#include<cstdio>
#include<vector>
#include<algorithm>
#include<set>
#include<iostream>


using namespace std;

#define rep(i,n) for(int i=0; i<(int)n; i++)
#define st first
#define nd second
#define mp make_pair
#define pb push_back

typedef vector<int> vi;
typedef pair<int,int> pi;
typedef vector<pi> vpii;
typedef set<int> SI;
typedef long long LL;

#ifdef DEBUG
const bool debug = true;
#else
const bool debug = false;
#endif
int n,m,k,l;
const int inf = 1000 * 1000 * 1000 ;
const int MAKSN = 1000 * 1000 + 13; // UZUPElnic
LL in[5], t[5];

bool ansPoss;

void readIn()
{
	ansPoss = true;

	cin>>n;
	n--;
	rep(i,4)
		cin>>t[i];

}


void solve()
{
	rep(i,n)
	{
		rep(j,4)
		{
			cin>>in[j];

			if(j % 2 == 0)
			{
				if(in[j] < t[j])
				{
					t[j] = in[j];
					ansPoss = false;
				}
			}
			else
			{
				if(in[j] > t[j])
				{
					t[j] = in[j];
					ansPoss = false;
				}
			}
		}

		bool all = true;

		rep(j,4)
		{
			if(in[j] != t[j])
				all = false;
		}

		if(all == true) ansPoss = true;
	}
}

int main()
{
	int tests;
	cin>>tests;
	rep(i,tests)
	{
		readIn();
		solve();
		ansPoss ? cout<<"TAK\n" : cout<<"NIE\n";
	}

	return 0;
}