pku2060

/*
 * File:   pku2060.cpp
 * Author: chenjiang
 *
 * Created on 2010年4月21日, 上午11:15
 */

#include <stdlib.h>
#include <stdio.h>
#include <string.h>
#include <iostream>
#include <math.h>
#include <algorithm>
using namespace std;
#define _max 505
int mapmap[_max][_max], M;

struct node {
    int a, b, c, d;
    int start;
    int end;
} ride[_max];
int my[_max];
bool visited[_max];

bool find(int x) {
    int i;
    for (i = 1; i <= M; i++) {
        if (!visited[i] && mapmap[x][i]) {
            visited[i] = 1;
            if (my[i] == -1 || find(my[i])) {
                my[i] = x;
                return 1;
            }
        }
    }
    return 0;
}

int MMG() {
    int i, ans = 0;
    memset(my, -1, sizeof (my));
    for (i = 1; i <= M; i++) {
        memset(visited, 0, sizeof (visited));
        if (find(i))
            ans++;
    }
    return ans;
}

/*
 *
 */
int main(int argc, char** argv) {

    int i, j, ca;
    //freopen("a.a", "r", stdin);
    scanf("%d", &ca);
    while (ca--) {
        scanf("%d", &M);
        for (i = 1; i <= M; i++) {
            int a, b, c, d, hh, mm;
            scanf("%d:%d %d %d %d %d", &hh, &mm, &a, &b, &c, &d);
            ride[i].a = a;
            ride[i].b = b;
            ride[i].c = c;
            ride[i].d = d;
            ride[i].start = hh * 60 + mm;
            int t = abs(a - c) + abs(b - d);
            ride[i].end = ride[i].start + t;
        }
        memset(mapmap, 0, sizeof (mapmap));
        for (i = 1; i <= M; i++) {
            for (j = i + 1; j <= M; j++) {
                if (ride[i].end + abs(ride[i].c - ride[j].a) + abs(ride[i].d - ride[j].b) < ride[j].start) {
                    mapmap[i][j] = 1;
                }
            }
        }
        int ans = MMG();
        cout << M - ans << endl;
    }
    return (EXIT_SUCCESS);
}