#include <cstdio>

 #include <cstring>

 #include <vector>

 #include <algorithm>

 using namespace std;

 const int maxn =  + ; // 单侧顶点的最大数目

 struct BPM {

     int n,m;

     vector<int> G[maxn];

     int left[maxn];

     bool T[maxn];

     int right[maxn];

     bool S[maxn];

     void init(int n,int m) {

         this->n = n;

         this->m = m;

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

             G[i].clear();

     }

     void AddEdge(int u,int v) {

         G[u].push_back(v);

     }

     bool match(int u) {

         S[u] = true;

         for(int i=; i<G[u].size(); i++) {

             int v = G[u][i];

             if(!T[v]) {

                 T[v] = true;

                 if(left[v]==-||match(left[v])) {

                     left[v] = u;

                     right[u] = v;

                     return true;

                 }

             }

         }

         return false;

     }

     int solve() {

         memset(left,-,sizeof(left));

         memset(right,-,sizeof(right));

         int ans = ;

         for(int u=; u<n; u++) {

             memset(S,,sizeof(S));

             memset(T,,sizeof(T));

             if(match(u))

                 ans++;

         }

         return ans;

     }

 } sol;

 int x1[maxn], y1[maxn], x2[maxn], y2[maxn], t1[maxn], t2[maxn];

 int dist(int a, int b, int c, int d) {

     return abs(a-c) + abs(b-d);

 }

 int main() {

     int T;

     scanf("%d", &T);

     while(T--) {

         int n;

         scanf("%d", &n);

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

             int h, m;

             scanf("%d:%d%d%d%d%d", &h, &m, &x1[i], &y1[i], &x2[i], &y2[i]);

             t1[i] = h*+m;

             t2[i] = t1[i] + dist(x1[i], y1[i], x2[i], y2[i]);

         }

         sol.init(n, n);

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

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

                 if(t2[i] + dist(x2[i], y2[i], x1[j], y1[j]) < t1[j])

                     sol.AddEdge(i,j);

         printf("%d\n", n - sol.solve());

     }

     return ;

 }