#include <bits/stdc++.h>
#define ll long long
using namespace std;

const int N = 5e3 + 50;

int T, n;

struct Point {
    int x, y, z;
    Point (int x=0, int y=0, int z=0): x(x), y(y), z(z) {}
    Point operator + (Point r) { return Point(x+r.x, y+r.y, z+r.z); }
    Point operator - (Point r) { return Point(x-r.x, y-r.y, z-r.z); }
    Point operator * (int r) { return Point(x*r, y*r, z*r); }
    Point operator / (int r) { return Point(x/r, y/r, z/r); }
    bool operator == (Point r) { return x==r.x&&y==r.y&&z==r.z; }
    bool operator != (Point r) { return x!=r.x||y!=r.y||z!=r.z; }
    void input () { scanf ("%d%d%d", &x, &y, &z); }
};

struct Line {
    Point p, v;
};

Point Cross (Point a, Point b) {
    return Point (a.y*b.z - a.z*b.y, -(a.x*b.z - a.z*b.x), a.x*b.y - a.y*b.x);
}

int Dot (Point a, Point b) {
    return a.x*b.x + a.y*b.y + a.z*b.z;
}

Line build (Line a, Line b) {
    Point v1 = Cross (a.v, b.v);
    Point v2 = Cross (a.p - b.p, b.v);
    if (v1 != Point ()) return {a.p, v1};
    return {a.p, v2};
}

Line p[N];

bool allsame () {
    for (int i = 2; i <= n; i ++) {
        Point v1 = Cross (p[1].v, p[i].v);
        Point v2 = Cross (p[1].p - p[i].p, p[i].v);
        if (v1 != Point () || v2 != Point ()) return false;
    }
    return true;
}

bool check (Line plane, Line a) {
    if (Dot (plane.p - (a.p + a.v), plane.v)) return false;
    if (Dot (plane.p - (a.p - a.v), plane.v)) return false;
    return true;
}

int solve (Line plane) {
    int ans = 0;
    for (int i = 1; i <= n; i ++) {
        ans += check (plane, p[i]);
    }
    return ans;
}


int main () {

    scanf ("%d", &T);
    while (T --) {
        scanf ("%d", &n);
        for (int i = 1; i <= n; i ++) {
            Point p1, p2;
            p1.input (), p2.input ();
            p[i] = {p1, p1 - p2};
        }
        if (allsame ()) {
            printf("%d\n", n);
            continue;
        }
        int ans = 1;
        for (int i = 1; i <= n; i ++) {
            for (int j = i + 1; j <= n; j ++) {
                Line plane = build (p[i], p[j]);
                if (plane.v == Point ()) continue;
                ans = max (solve (plane), ans);
            }
        }
        printf("%d\n", ans);
    }

    return 0;
}