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
#include <cstdio>
#include <cstring>
#include <cmath>
#include <cassert>
#include <iostream>
#include <algorithm>
#include <iterator>
#include <string>
#include <vector>
#include <queue>
#include <bitset>
#include <utility>
#include <stack>

using namespace std;
typedef long long LL;
typedef pair<int,int> PII;
typedef vector<int> VI;
#define MP make_pair
#define FOR(v,p,k) for(int v=(p);v<=(k);++v)
#define FORD(v,p,k) for(int v=(p);v>=(k);--v)
#define REP(i,n) for(int i=0;i<(n);++i)
#define VAR(v,i) __typeof(i) v=(i)
#define FOREACH(i,c) for(VAR(i,(c).begin());i!=(c).end();++i)
#define PB push_back
#define ST first
#define ND second
#define SIZE(x) (int)x.size()
#define ALL(c) c.begin(),c.end()

#define ODD(x) ((x)%2)
#define EVEN(x) (!(ODD(x)))

class Mirror {
  int w1,w2,h1,h2;
  bool coveredBySingle;

public:
  Mirror() {
    scanf("%d%d%d%d", &w1, &w2, &h1, &h2);
    coveredBySingle = true;
  }

  void extend(const Mirror &other) {
    if (isCoveredBy(other)) {
      *this = other;
    } else if (!other.isCoveredBy(*this)) {
      coveredBySingle = false;
      w1 = min(w1, other.w1);
      w2 = max(w2, other.w2);
      h1 = min(h1, other.h1);
      h2 = max(h2, other.h2);
    }
  }

  bool isCoveredBy(const Mirror &other) const {
    return other.w1 <= w1 && w2 <= other.w2 && 
           other.h1 <= h1 && h2 <= other.h2;
  }

  void printResult() const {
    printf("%s\n", coveredBySingle ? "TAK" : "NIE");
  } 
};

int main() {
  int t;
  scanf("%d", &t);
  REP(tt,t) {
    int n;
    scanf("%d", &n);
    Mirror accumulatedMirror;
    REP(nn,n-1) accumulatedMirror.extend(Mirror());
    accumulatedMirror.printResult();
  }
  return 0;
}