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
//Tadrion
#include <cstdio>
#include <vector>
#include <iostream>
#include <deque>
#include <map>
#include <set>
#include <string>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <queue>
#include <stack>
#include <algorithm>
#include <utility>
using namespace std;
#define MAX(a,b) ((a) > (b) ? (a) : (b))
#define MIN(a,b) ((a) < (b) ? (a) : (b))
#define CLEAR(x) (memset(x,0,sizeof(x)))
#define SZ(x) ((int)(x).size())
#define ALL(x) (x).begin(),(x).end()
#define VAR(v, n) __typeof(n) v = (n)
#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 FOREACH(i, c) for(VAR(i,(c).begin()); i != (c).end(); ++i)
#define DBG(v) cout<<#v<<" = "<<v<<endl;
#define IN(x,y) ((y).find(x)!=(y).end())
#define ST first
#define ND second
#define PB push_back
#define PF push_front
#define MP make_pair
typedef long long int LL;
typedef pair<int,int> PII;
typedef vector<int> VI;
int t,n;
int minx,miny,maxx,maxy;
vector<pair<PII,PII> > v;
int a,b,c,d;
int main() {
  scanf("%d",&t);
  FOR(ttt,1,t) {
    scanf("%d",&n);
    v.clear();
    scanf("%d %d %d %d",&minx,&maxx,&miny,&maxy);
    v.PB(MP(MP(minx,maxx),MP(miny,maxy)));
    FOR(i,2,n) {
        scanf("%d %d %d %d",&a,&b,&c,&d);
        minx = MIN(minx,a);
        maxx = MAX(maxx,b);
        miny = MIN(miny,c);
        maxy = MAX(maxy,d);
        v.PB(MP(MP(a,b),MP(c,d)));
    }
    int ok = 0;
    REP(i,SZ(v)) {
        if(v[i].ST.ST == minx &&
           v[i].ST.ND == maxx &&
           v[i].ND.ST == miny &&
           v[i].ND.ND == maxy) ok =1;
    }
    printf("%s\n",ok ? "TAK" : "NIE");
  }
  return 0;
}