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

const int MOD = 998244353;
const int N = 55;

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); }
    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); }
    void show () { printf("x = %d, y = %d, z = %d\n", x, y, z); }
};

Point Cross (Point a, Point b) { 
    return Point(a.y*b.z-a.z*b.y, -(a.x*b.z-b.x*a.z), 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;
}

struct Line {
    Point p, v;
};

Line get_plane (Point a, Point b, Point c) {
    return { a,  Cross (a - b, a - c) };
}

int T, n, m;
Point p[N << 1];
Line li[N];

int check (Line plane) {
    int res = 0;
    for (int i = 1; i <= n; i ++){
        int d1 = Dot (li[i].p - plane.p, plane.v);
        int d2 = Dot (li[i].v - plane.p, plane.v);
        res += (d1 >= 0 && d2 <= 0) || (d1 <= 0 && d2 >= 0);
    }
    return res;
}

int main () {
    scanf ("%d", &T);
    while (T -- ){
        scanf ("%d", &n);
        m = 0;
        for (int i = 1; i <= n; i ++) {
            li[i].p.input ();
            li[i].v.input ();
            p[++ m] = li[i].p;
            p[++ m] = li[i].v;
        }

        int ans = 1;
        for (int i = 1; i <= m; i ++) {
            for (int j = i + 1; j <= m; j ++) {
                for (int k = j + 1; k <= m; k ++) {
                    if (Cross (p[i] - p[j], p[i] - p[k]) == Point()) continue;
                    Line plane = get_plane (p[i], p[j], p[k]);
                    ans = max (ans, check (plane));
                }
            }
        }

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

    return 0;
}