#include <bits/stdc++.h>
using namespace std;
const int maxn = 105;
const double eps = 1e-8;
int T,n;
struct Pt{
	double x,y,z;
	Pt operator - (const Pt&t) const {return (Pt){x-t.x,y-t.y,z-t.z};}
	double sql(){return x*x+y*y+z*z;}
	double operator * (const Pt&t) const {return x*t.x+y*t.y+z*t.z;}
	Pt operator ^ (const double&t) const {return (Pt){x*t,y*t,z*t};}
}a[maxn][2],b[maxn];
inline bool chk(int A,int B,int C){
	Pt v1=b[B]-b[A], v2=b[C]-b[A];
	return fabs(fabs((v1*v2)*(v1*v2))-v1.sql()*v2.sql())<eps;
}
inline Pt proc(Pt A,Pt E){
	double lb = (A*E)/A.sql();
	assert(fabs((E - (A^lb))*A)<=eps);
	return E - (A^lb);
}
inline bool getcrs(int A,int B,int C,int idx){
	Pt v1=b[B]-b[A], v2=b[C]-b[A];
	assert(v1.sql()>eps);
	assert(v2.sql()>eps);
	Pt a1 = a[idx][0]-b[A];
	Pt a2 = a[idx][1]-b[A];
/*	a1 = proc(v1,a1);
	printf("f1 %.1lf %.1lf %.1lf\n",a1.x,a1.y,a1.z);
	printf("f2 %.1lf %.1lf %.1lf\n",a2.x,a2.y,a2.z);
	printf("f3 %.1lf %.1lf %.1lf\n",v1.x,v1.y,v1.z);
	printf("f4 %.1lf %.1lf %.1lf\n",v2.x,v2.y,v2.z);
*/	a1 = proc(v1,proc(v2,a1));
	a2 = proc(v1,proc(v2,a2));
	return a1*a2 <= eps;
}
int main(){
	scanf("%d",&T);
	while(T--){
		scanf("%d",&n);
		for(int al=1;al<=n;al++)for(int be=0;be<2;be++)
			scanf("%lf%lf%lf",&a[al][be].x,&a[al][be].y,&a[al][be].z), b[(al-1)*2+1+be]=a[al][be];
		int flg = 0, ans = 0;
		for(int al=1;al<=2*n;al++)for(int be=al+1;be<=2*n;be++)for(int ga=be+1;ga<=2*n;ga++)if(!chk(al,be,ga)){
			flg = 1; int cnt = 0;
			for(int idx=1;idx<=n;idx++)if(getcrs(al,be,ga,idx)) ++cnt;
			ans = max(ans,cnt);
		}
		printf("%d\n",flg ? ans:n);
//		printf("ft %d\n",getcrs(1,5,7,2));
	}
	return 0;
}