#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

using namespace std;

using Int = long long;

template <class T1, class T2> ostream &operator<<(ostream &os, const pair<T1, T2> &a) { return os << "(" << a.first << ", " << a.second << ")"; };
template <class T> ostream &operator<<(ostream &os, const vector<T> &as) { const int sz = as.size(); os << "["; for (int i = 0; i < sz; ++i) { if (i >= 256) { os << ", ..."; break; } if (i > 0) { os << ", "; } os << as[i]; } return os << "]"; }
template <class T> void pv(T a, T b) { for (T i = a; i != b; ++i) cerr << *i << " "; cerr << endl; }
template <class T> bool chmin(T &t, const T &f) { if (t > f) { t = f; return true; } return false; }
template <class T> bool chmax(T &t, const T &f) { if (t < f) { t = f; return true; } return false; }
#define COLOR(s) ("\x1b[" s "m")


inline int sig(Int r) { return (r < 0) ? -1 : (r > 0) ? +1 : 0; }
inline Int sq(Int r) { return r * r; }

struct PT {
  Int x, y, z;
  PT() {}
  PT(Int x_, Int y_, Int z_) : x(x_), y(y_), z(z_) {}
  PT operator+(const PT &a) const { return PT(x + a.x, y + a.y, z + a.z); }
  PT operator-(const PT &a) const { return PT(x - a.x, y - a.y, z - a.z); }
  PT operator+() const { return PT(+x, +y, +z); }
  PT operator-() const { return PT(-x, -y, -z); }
  PT operator*(const Int &k) const { return PT(x * k, y * k, z * k); }
  PT operator/(const Int &k) const { return PT(x / k, y / k, z / k); }
  friend PT operator*(const Int &k, const PT &a) { return PT(k * a.x, k * a.y, k * a.z); }
  PT &operator+=(const PT &a) { x += a.x; y += a.y; z += a.z; return *this; }
  PT &operator-=(const PT &a) { x -= a.x; y -= a.y; z -= a.z; return *this; }
  PT &operator*=(const Int &k) { x *= k; y *= k; z *= k; return *this; }
  PT &operator/=(const Int &k) { x /= k; y /= k; z /= k; return *this; }
  Int abs2() const { return x * x + y * y + z * z; }
  Int dot(const PT &a) const { return x * a.x + y * a.y + z * a.z; }
  PT cross(const PT a) const { return PT(y * a.z - z * a.y, z * a.x - x * a.z, x * a.y - y * a.x); }
  friend ostream &operator<<(ostream &os, const PT &a) { os << "(" << a.x << ", " << a.y << ", " << a.z << ")"; return os; }
};
PT tri(const PT &a, const PT &b, const PT &c) { return (b - a).cross(c - a); }
Int tet(const PT &a, const PT &b, const PT &c, const PT &d) { return (b - a).cross(c - a).dot(d - a); }


// !!!no 4 points coplanar!!!
vector<vector<int>> convexHull(const vector<PT> &ps) {
  const int n = ps.size();
  // vector<vector<bool>> s(n, vector<bool>(n, false));
  static bool s[3010][3010];
  vector<vector<int>> crt{{0, 1, 2}, {0, 2, 1}};
  for (int i = 3; i < n; ++i) {
    for (const auto &f : crt) s[f[1]][f[2]] = s[f[2]][f[0]] = s[f[0]][f[1]] = (tet(ps[f[0]], ps[f[1]], ps[f[2]], ps[i]) < 0);
    vector<vector<int>> nxt;
    for (const auto &f : crt) {
      if (s[f[1]][f[2]]) {
        nxt.push_back(f);
      } else {
        if (s[f[2]][f[1]]) nxt.push_back({f[1], f[2], i});
        if (s[f[0]][f[2]]) nxt.push_back({f[2], f[0], i});
        if (s[f[1]][f[0]]) nxt.push_back({f[0], f[1], i});
      }
    }
    crt.swap(nxt);
  }
  return crt;
}


int N;
vector<PT> P;

int main() {
  for (int numCases; ~scanf("%d", &numCases); ) { for (int caseId = 1; caseId <= numCases; ++caseId) {
    scanf("%d", &N);
    P.resize(N);
    for (int u = 0; u < N; ++u) {
      scanf("%lld%lld%lld", &P[u].x, &P[u].y, &P[u].z);
    }
    
    Int ans = 0;
    for (auto ps = P; ; ) {
      const int n = ps.size();
      if (n < 4) break;
      const auto uss = convexHull(ps);
      vector<int> used(n, 0);
      Int vol = 0;
      for (const auto &us : uss) {
        vol += tet(PT(0, 0, 0), ps[us[0]], ps[us[1]], ps[us[2]]);
        for (const int u : us) used[u] = 1;
      }
// cerr<<ps<<": "<<vol<<" "<<uss<<endl;
      ans += vol;
      vector<PT> qs;
      for (int u = 0; u < n; ++u) if (!used[u]) qs.push_back(ps[u]);
      ps.swap(qs);
    }
    printf("%lld\n", ans);
  }
#ifndef LOCAL
  break;
#endif
  }
  return 0;
}