#include<cstdio>

 #include<cstring>

 #include<cstdlib>

 #include<cmath>

 #include<algorithm>

 using namespace std;

 struct node

 {

     int w1,w2,h1,h2;

 }a[];

 int T,n;

 bool cmp(node n1,node n2)

 {

     if(n1.w2!=n2.w2)return n1.w2<n2.w2;

     if(n1.w1!=n2.w1)return n1.w1>n2.w1;

     if(n1.h2!=n2.h2)return n1.h2<n2.h2;

     if(n1.h1!=n2.h1)return n1.h1>n2.h1;

     return false;

 }

 int main()

 {

     scanf("%d",&T);

     while(T--)

     {

         scanf("%d",&n);

         for(int i=;i<=n;i++)scanf("%d%d%d%d",&a[i].w1,&a[i].w2,&a[i].h1,&a[i].h2);

         sort(a+,a+n+,cmp);int wo=a[n].w1,wt=a[n].w2,ho=a[n].h1,ht=a[n].h2;bool bk=true;

         for(int i=;i<n;i++)if(wo>a[i].w1 || wt<a[i].w2 || ho>a[i].h1 || ht<a[i].h2){bk=false;break;}

         if(bk==true)printf("TAK\n");

         else printf("NIE\n");

     }

     return ;

 }