#include <iostream>

 #include<cstdio>

 #include<cstring>

 #include<algorithm>

 #include<stdlib.h>

 using namespace std;

 #define INF 0xfffffff

 struct node

 {

     int lx,ly,rx,ry,d;

 }co[];

 int kk[][],o[];

 int num[][],oo[],ans,fk[];

 int n;

 void dfs(int u,int de,int vis[])

 {

     int i,j,ff=,vv[];

     if(de>ans)

     return ;

     for(i =  ; i <= oo[u] ; i++)

     {

         int v = num[u][i];

         ff = ;

         for(j = ; j <= o[v] ; j++)

         {

             int ko = kk[v][j];

             if(!vis[ko])

             {

                 ff=;

                 break;

             }

         }

         if(ff)

         vis[v]=;

     }

     for(i = ; i <= n ; i++)

     if(!vis[i])

     break;

     if(i==n+)

     {

         ans = de;

         return ;

     }

     for(i = ; i <= n ; i++)

     vv[i] = vis[i];

     for(i = ; i <= n ; i++)

     {

         if(!vis[i])

         {

             for(j = ; j <= o[i] ; j++)

             {

                 int x = kk[i][j];

                 if(!vis[x])

                 break;

             }

             if(j>o[i])

             dfs(co[i].d,de+,vis);

         }

         for(j = ; j <= n ; j++)

         vis[j] = vv[j];

     }

 }

 int main()

 {

     int i,j,t,vis[];

     scanf("%d",&t);

     while(t--)

     {

         scanf("%d",&n);

         memset(vis,,sizeof(vis));

         memset(kk,,sizeof(kk));

         memset(o,,sizeof(o));

         memset(oo,,sizeof(oo));

         memset(fk,,sizeof(fk));

         ans = INF;

         for(i = ; i <= n ; i++)

         {

             scanf("%d%d%d%d%d",&co[i].ly,&co[i].lx,&co[i].ry,&co[i].rx,&co[i].d);

             oo[co[i].d]++;

             num[co[i].d][oo[co[i].d]] = i;

         }

         for(i = ; i <= n ; i++)

         {

             for(j =  ; j <= n ; j++)

             {

                 if(i==j)

                 continue;

                 if(((co[j].lx>=co[i].lx&&co[j].lx<co[i].rx)||(co[j].rx<=co[i].rx&&co[j].rx>co[i].lx))&&(co[j].ry<=co[i].ly))

                 {

                     o[i]++;

                     kk[i][o[i]] = j;

                 }

             }

         }

         for(i = ; i <= n ; i++)

         {

             if(!o[i]&&!fk[co[i].d])

             {

                 fk[co[i].d] = ;

                 dfs(co[i].d,,vis);

             }

             memset(vis,,sizeof(vis));

         }

         printf("%d\n",ans);

     }

     return ;

 }