#include <bits/stdc++.h>
using namespace std;
#define rep(i,a,n) for (int i=a;i<n;i++)
#define per(i,a,n) for (int i=n-1;i>=a;i--)
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define SZ(x) ((int)(x).size())
typedef vector<int> VI;
typedef basic_string<int> BI;
typedef long long ll;
typedef pair<int,int> PII;
typedef long long db;
mt19937 mrand(random_device{}()); 
const ll mod=1000000007;
int rnd(int x) { return mrand() % x;}
ll powmod(ll a,ll b) {ll res=1;a%=mod; assert(b>=0); for(;b;b>>=1){if(b&1)res=res*a%mod;a=a*a%mod;}return res;}
ll gcd(ll a,ll b) { return b?gcd(b,a%b):a;}
// head

const int N=3010;

struct P3{
    db x,y,z;
    P3() {}
    P3(db x,db y,db z):x(x),y(y),z(z) {}
    P3 operator+(P3 o){ return {x+o.x,y+o.y,z+o.z}; }
    P3 operator-(P3 o){ return {x-o.x,y-o.y,z-o.z}; }
    db operator*(P3 o){ return x*o.x+y*o.y+z*o.z; }
    P3 operator^(P3 o){ return {y*o.z-z*o.y,z*o.x-x*o.z,x*o.y-y*o.x}; }
    P3 operator*(db o){ return {x*o,y*o,z*o}; }
    P3 operator/(db o){ return {x/o,y/o,z/o}; }
};
db Volume(P3 a,P3 b,P3 c,P3 d){
    return ((b-a)^(c-a))*(d-a);
}
__int128 ans=0;
typedef vector<P3> VP;
typedef vector<VP> VVP;

namespace CH3{
    VVP ret;
    set<pair<int,int> > eg;
    set<int> pt;
    int n;
    VP p,q;

    void wrap(int a,int b){
        if (eg.find({a,b})==eg.end()){
            int c=-1;
            for (int i=0;i<n;i++)if (i!=a && i!=b){
                if (c==-1 || Volume(q[c],q[a],q[b],q[i])>0)
                    c=i;
            }
            if (c!=-1){
            	ans+=Volume(P3(0,0,0),p[a],p[b],p[c]);
                //ret.pb({p[a],p[b],p[c]});
                pt.insert(a); pt.insert(b); pt.insert(c);
                eg.insert({a,b});eg.insert({b,c});eg.insert({c,a});
                wrap(c,b);wrap(a,c);
            }
        }
    };

    VP convexHull3d(VP _p){
        p = q = _p; n = p.size();
        ret.clear(); eg.clear(); pt.clear();
        //ans=0;
        for (int i=1;i<n;i++)if (q[i].x<q[0].x)swap(p[0],p[i]),swap(q[0],q[i]);
        for (int i=2;i<n;i++)if (
            (q[i].x-q[0].x)*(q[1].y-q[0].y)>
            (q[i].y-q[0].y)*(q[1].x-q[0].x)) swap(q[1],q[i]),swap(p[1],p[i]);
        wrap(0,1);
    	VI pc(all(pt));
    	reverse(all(pc));
    	for (auto x:pc) {
    		q.erase(q.begin()+x);
    	}
    	return q;
    }
}

int n;
void solve() {
	cin>>n;
	ans=0;
	VP p;
	rep(i,0,n) {
		int x,y,z;
		cin>>x>>y>>z;
		p.pb(P3(x,y,z));
	}
	while (SZ(p)>=4) {
		p=CH3::convexHull3d(p);
	}
	VI dig;
	while (ans>0) dig.pb(ans%10),ans/=10;
	reverse(all(dig));
	if (SZ(dig)==0) dig.pb(0);
	for (auto x:dig) cout<<x;
	cout<<"\n";
	//printf("%lld\n",ans);
}

int _;
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	for (cin>>_;_;_--) {
		solve();
	}
}