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
#include <stdio.h>
#include <iostream>
#include <vector>

using namespace std;

typedef vector<int> VI;
typedef long long LL;
typedef pair<int,int> para;

#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(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 make_pair

#define M 1000000001


int main() {
  int t, n;
  scanf("%d", &t);

  REP(i,t) {
    int a[4], a0[4]={-M,0,-M,0};
    bool jest=true;

    scanf("%d", &n);

    REP(j,n) {
      bool stary=true, nowy=true;

      scanf("%d%d%d%d", &a[0], &a[1], &a[2], &a[3]);
      a[0]=-a[0]; a[2]=-a[2];

      REP(k,4) {
        if (a[k]>a0[k]) {a0[k]=a[k]; stary=false;}
        else if (a[k]<a0[k]) nowy=false;
      }

      jest= jest&stary | nowy;
    }

    if (jest) printf("%s","TAK\n"); else printf("%s","NIE\n");
  }

  return 0;
}