#include<iostream>
#include<algorithm>
#include<cmath>
#define int long long
#define double long double
#define INF 0x3f3f3f3f3f3f3f3f
using namespace std;
 
const double eps = 1e-9;
const int N = 510;
 
struct dot{
    double x, y, z;
    dot(double xx = 0, double yy = 0, double zz =0) : x(xx), y(yy), z(zz){}
};
 
inline void scan(dot &a){cin >> a.x >> a.y >> a.z;}
inline void print(dot &a){cout << a.x << a.y << a.z;}
 
struct line{
    dot d, a, b;
    line(dot dd, dot aa, dot bb) : d(dd), a(aa), b(bb){}
};
 
struct plane{
    dot d, a;
    plane(dot dd, dot aa) : d(dd), a(aa){}
};
 
inline dot operator + (const dot &a, const dot &b){return dot(a.x + b.x, a.y + b.y, a.z + b.z);}
inline dot operator - (const dot &a, const dot &b){return dot(a.x - b.x, a.y - b.y, a.z - b.z);}
inline double operator * (const dot &a, const dot &b){return a.x * b.x + a.y * b.y + a.z * b.z;}
inline dot operator ^ (const dot &a, const dot &b)
{
    return dot(a.y * b.z - a.z * b.y, a.z * b.x - a.x * b.z, a.x * b.y - a.y * b.x);
}
inline double len(const dot &a){return sqrt(a.x * a.x + a.y * a.y + a.z * a.z);}
 
int n;
dot a[N];
 
inline bool inte(const plane &p, const line &l){
    double t1 = (l.a - p.a) * p.d, t2 = (l.b - p.a) * p.d;
    if(abs(t1) < eps || abs(t2) < eps) return true;
    if((t1 > eps) ^ (t2 > eps)) return true;
    return false;
}
 
inline bool coll(const dot &a, const dot &b){
    return abs(len(a ^ b)) < eps;
}
 
void solve(){
    cin >> n;
    for(int i = 1; i <= 2 * n; i ++) scan(a[i]);
    int ans = 0;
    for(int i = 1; i < 2 * n; i ++){
        for(int j = 1; j < i; j ++){
            for(int k = 1; k < j; k++){
                dot t = (a[i] - a[j]) ^ (a[i] - a[k]);
                if(len(t) < eps) continue;
                plane p = plane(t, a[i]);
                int res = 0;
                for(int c = 1; c <= n; c++){
                    line l = line(a[2 * c - 1] - a[2 * c], a[2 * c - 1], a[2 * c]);
                    if(inte(p, l)) res ++;
                }
                ans = max(ans, res);
            }
            int res = 0;
            for(int c = 1; c <= n; c++){
                dot t = a[i] - a[j];
                if(coll(t, a[i] - a[2 * c - 1]) || coll(t, a[i] - a[2 * c])) res ++;
            }
            ans = max(ans, res);
        }
    }
    cout << ans << '\n';
}
 
signed main(){
    ios::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
    int t = 1;
    cin >> t;
    while(t--){
        solve();
    }
}