#include<bits/stdc++.h>
using namespace std;
//mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
#define mod 998244353
#define int long long
using i128=__int128;
#define inf 0x3f3f3f3f
#define INF 0x3f3f3f3f3f3f3f3f
inline int read()
{
	char ch=getchar(); int nega=1; while(!isdigit(ch)) {if(ch=='-') nega=-1; ch=getchar();}
	int ans=0; while(isdigit(ch)) {ans=ans*10+ch-48;ch=getchar();}
	if(nega==-1) return -ans;
	return ans;
}
void print(i128 v)
{
	if(v>=10) print(v/10);
	putchar(v%10+'0');
}
struct Vec3
{
	int x,y,z;
	int norm() {return x*x+y*y+z*z;}
	Vec3(int a=0,int b=0,int c=0) {x=a,y=b,z=c;}
	bool operator < (const Vec3 &o) const
	{
		if(x!=o.x) return x<o.x;
		if(y!=o.y) return y<o.y;
		return z<o.z;
	}
};
Vec3 operator + (Vec3 x,Vec3 y) {return Vec3(x.x+y.x,x.y+y.y,x.z+y.z);}
Vec3 operator - (Vec3 x,Vec3 y) {return Vec3(x.x-y.x,x.y-y.y,x.z-y.z);}
void print(Vec3 a) {printf("%lld %lld %lld\n",a.x,a.y,a.z);}
int cdot(Vec3 x,Vec3 y) {return x.x*y.x+x.y*y.y+x.z*y.z;}
Vec3 cross(Vec3 x,Vec3 y)
{
	return Vec3(x.y*y.z-x.z*y.y,
		x.z*y.x-x.x*y.z,
		x.x*y.y-x.y*y.x
	);
}
int volumn(Vec3 a,Vec3 b,Vec3 c,Vec3 d) // 6 * volumn (directed)
{
	return cdot(d-a,cross(b-a,c-a));
}
struct Plane
{
	Vec3 n; int d; // n dot x = d
	Plane() {}
	Plane(Vec3 a,int b) {n=a,d=b;}
	Plane(Vec3 a,Vec3 b,Vec3 c)
	{
		n=cross(b-a,c-a);
		d=cdot(n,a);
	}
};
struct Face
{
	int a[3]; Plane p;
};
#define N 3005
Vec3 a[N];
int n;
int vis[N][N],used[N],T;
vector<Face> ans;
void wrap(int u,int v)
{
	if(vis[u][v]==T) return ;
	int w=-1;
	for(int i=1;i<=n;i++)
	{
		if(i==u||i==v) continue;
		if(w==-1) w=i;
		else
		{
			if(volumn(a[u],a[v],a[w],a[i])>0) w=i;
		}
	}
	if(w!=-1)
	{
		ans.push_back({{u,v,w},Plane(a[u],a[v],a[w])});
		vis[u][v]=vis[v][w]=vis[w][u]=T;
		wrap(w,v),wrap(u,w);
	}
}
i128 sum;
void solve()
{
	int u=2;
	for(int i=2;i<=n;i++) if(cross(a[i]-a[1],a[u]-a[1]).y>0) u=i;
	for(int i=1;i<=n;i++) used[i]=0;
	T++;
	ans.clear();
	wrap(1,u);
	for(auto [n,p]:ans) 
	{
		sum+=p.d;
		auto [a,b,c]=n;
		used[a]=used[b]=used[c]=1;
	}
	int tmp=0;
	for(int i=1;i<=n;i++) if(!used[i]) a[++tmp]=a[i];
	n=tmp;
}
void work()
{
	cin>>n;
	for(int i=1;i<=n;i++) cin>>a[i].x>>a[i].y>>a[i].z;
	sort(a+1,a+n+1);
	sum=0;
	while(n>=4) solve();
	print(sum); putchar('\n');
}
signed main()
{
	int T=read(); while(T--) work();
	return 0;
}