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
#include <iostream>
#include <cstdio>
#include <string>
#include <sstream> 
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <cmath>
#include <algorithm>
#include <cstring>
#include <ctime>
using namespace std;
#define pb push_back
#define mp make_pair
#define pii pair<int,int>
#define vi vector<int>
#define SZ(x) ((int)(x.size()))
#define fi first
#define se second
#define FOR(i,n) for(int (i)=0;(i)<(n);++(i))
#define FORI(i,n) for(int (i)=1;(i)<=(n);++(i))
#define IN(x,y) ((y).find((x))!=(y).end())
#define ALL(t) t.begin(),t.end()
#define FOREACH(i,t) for (typeof(t.begin()) i=t.begin(); i!=t.end(); i++)
#define REP(i,a,b) for(int (i)=(a);(i)<=(b);++i)
#define REPD(i,a,b) for(int (i)=(a); (i)>=(b);--i)
#define REMAX(a,b) (a)=max((a),(b));
#define REMIN(a,b) (a)=min((a),(b));
#define DBG cerr << "debug here" << endl;
#define DBGV(vari) cerr << #vari<< " = "<< (vari) <<endl;

const int MAX_N = 100000;

int wl[MAX_N], wh[MAX_N], hl[MAX_N], hh[MAX_N];

int main()
{
    ios_base::sync_with_stdio(0);
    int t;
    cin >> t;
    while(t-- > 0)
    {
        int n;
        cin >> n;
        FOR(i, n) cin >> wl[i] >> wh[i] >> hl[i] >> hh[i];
        int w1 = *min_element(wl, wl + n);
        int w2 = *max_element(wh, wh + n);
        int h1 = *min_element(hl, hl + n);
        int h2 = *max_element(hh, hh + n);
        string ans = "NIE";
        FOR(i, n)
        {
            if(wl[i] == w1 && wh[i] == w2 && hl[i] == h1 && hh[i] == h2)
            {
                ans = "TAK";
                break;
            }
        }
        cout << ans << "\n";
    }
    return 0;
}