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
#include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <vector>
#include <cmath>
#include <cstring>
#include <string>
#include <iostream>
#include <complex>
#include <sstream>
using namespace std;
 
typedef long long LL;
typedef unsigned long long ULL;
typedef long double LD;
typedef vector<int> VI;
typedef pair<int,int> PII;
 
#define REP(i,n) for(int i=0;i<(n);++i)
#define SIZE(c) ((int)((c).size()))
#define FOR(i,a,b) for (int i=(a); i<(b); ++i)
#define FOREACH(i,x) for (__typeof((x).begin()) i=(x).begin(); i!=(x).end(); ++i)
#define FORD(i,a,b) for (int i=(a)-1; i>=(b); --i)
#define ALL(v) (v).begin(), (v).end()
 
#define pb push_back
#define mp make_pair
#define st first
#define nd second

int W[200000][2], H[200000][2];

void scase() {
  int N;
  scanf("%d",&N);
  REP(i,N) scanf("%d%d%d%d",&W[i][0],&W[i][1],&H[i][0],&H[i][1]);
  int A = W[0][0], B = W[0][1], C = H[0][0], D = H[0][1];
  REP(i,N) {
    A = min(W[i][0], A);
    B = max(W[i][1], B);
    C = min(H[i][0], C);
    D = max(H[i][1], D);
  }
  
  REP(i,N) {
    if (A != W[i][0]) continue;
    if (B != W[i][1]) continue;
    if (C != H[i][0]) continue;
    if (D != H[i][1]) continue;
    printf("TAK\n");
    return;
  }
  
  printf("NIE\n");
}

int main() {
  int Z;
  scanf("%d", &Z);
  REP(z,Z) {
    scase();
  }
}