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
#include <cstdio>
#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <set>
#include <bitset>
#include <map>
#include <list>
#include <stack>
#include <queue>
#include <deque>
#include <complex>
#include <iterator>
#include <tr1/unordered_map>


using namespace std;

typedef vector<int> VI;
typedef long long LL;

#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(x,n) __typeof(n) x = (n)
#define ALL(c) (c).begin(), (c).end()
#define SIZE(c) ((int)(c).size())
#define FOREACH(i,c) for(VAR(i, (c).begin()); i!=(c).end(); ++i)
#define PB push_back
#define PF push_front
#define ST first
#define ND second
#define MP make_pair
#define MIN(a,b) ((a) < (b) ? (a) : (b))
#define MAX(a,b) ((a) > (b) ? (a) : (b))

#define N 100002

int tab[N][4];
int m0,m1,m2,m3;

int main(){
    int t, n,ok;
    scanf("%d", &t);
    REP(j,t){
        scanf("%d",&n);
        scanf("%d %d %d %d", &tab[0][0], &tab[0][1], &tab[0][2], &tab[0][3]);
        m0 = tab[0][0];
        m1 = tab[0][1];
        m2 = tab[0][2];
        m3 = tab[0][3];
        FOR(i,1,n-1){
            scanf("%d %d %d %d", &tab[i][0], &tab[i][1], &tab[i][2], &tab[i][3]);
            m0 = MIN(m0, tab[i][0]);
            m1 = MAX(m1, tab[i][1]);
            m2 = MIN(m2, tab[i][2]);
            m3 = MAX(m3, tab[i][3]);
        }
        ok = 0;
        REP(i,n){
            if(m0==tab[i][0] && m1==tab[i][1] && m2==tab[i][2] && m3==tab[i][3]){
                ok = 1;
                break;
            }
        }
        if(ok)
            printf("TAK\n");
        else
            printf("NIE\n");
    }
    return 0;
}