#include <bits/stdc++.h>
#define ll long long
using namespace std;
const ll N = 2e5 + 10;
ll n, m;
struct Point {
  ll x, y, idx;
  bool operator<(const Point &b) const { return x == b.x ? y < b.y : x < b.x; }
  friend Point operator-(Point a, Point b) { return {a.x - b.x, a.y - b.y}; }
};
ll vis[N];
ll cross(Point a, Point b) { return a.x * b.y - a.y * b.x; }
ll cross(Point a, Point b, Point c) { return cross(b - a, c - a); }
ll dot(Point a, Point b) { return a.x * b.x + a.y * b.y; }
// Point operator-(Point a, Point b) { return {a.x - b.x, a.y - b.y}; }
// Point operator+(Point a, Point b) { return {a.x + b.x, a.y + b.y}; }
// Point operator*(Point a, ll b) { return {a.x * b, a.y * b}; }
// Point operator/(Point a, ll b) { return {a.x / b, a.y / b}; }
// ll dis(Point a) { return a.x * a.x + a.y * a.y; }
// ll dis(Point a, Point b) { return dis(a - b); }
vector<Point> a1, con1, con2, a2;
vector<Point> get_hull(vector<Point> &a) {
  ll n = a.size();
  if (n <= 2) {
    return a;
  }
  vector<Point> ans(n * 2);
  sort(a.begin(), a.end());
  ll now = -1;
  for (ll i = 0; i < n; i++) {
    while (now > 0 && cross(a[i], ans[now], ans[now - 1]) > 0) {
      now--;
    }
    ans[++now] = a[i];
  }
  ll pre = now;
  for (ll i = n - 2; i >= 0; i--) {
    while (now > pre && cross(a[i], ans[now], ans[now - 1]) > 0) {
      now--;
    }
    ans[++now] = a[i];
  }
  ans.resize(now);
  return ans;
}
void solve() {
  ll n;
  a1.clear();
  a2.clear();
  con1.clear();
  con2.clear();
  cin >> n;
  for (ll i = 1; i <= n; i++) vis[i] = 0;
  for (ll i = 1; i <= n; i++) {
    ll x, y;
    cin >> x >> y;
    a1.emplace_back((Point){x, y, i});
  }

  con1 = get_hull(a1);
  for (auto aaa : con1) {
    vis[aaa.idx] = 1;
  }
  if (con1.size() == n) {
    cout << -1 << "\n";
    return;
  }
  for (auto aaa : a1) {
    if (vis[aaa.idx] == 0) {
      a2.push_back(aaa);
    }
  }
  con2 = get_hull(a2);
  ll ans = 0;
  ll l = 0, r = 0;
  ll len1 = con1.size();
  ll len2 = con2.size();
  ll minn = 1e18;
  for (ll j = 0; j < len2; j++) {
    if (cross(con1[0], con1[1], con2[j]) < minn) {
      minn = cross(con1[0], con1[1], con2[j]);
      r = j;
    }
  }

  for (ll i = 0; i < len1; i++) {
    ans = ans + cross(con1[i], con1[(i + 1) % len1]);
  }

  ans = abs(ans);
  ll tmp = 1e18;
  tmp = minn;
  for (ll i = 0; i < len1; i++) {
    while (abs(cross(con1[i], con1[(i + 1) % len1], con2[(r + 1) % len2])) <
           abs(cross(con1[i], con1[(i + 1) % len1], con2[r]))) {
      r = (r + 1) % len2;
    }

    tmp = min(tmp, abs(cross(con1[i], con1[(i + 1) % len1], con2[r])));
  }
  cout << ans - tmp << "\n";
}

int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  ll t = 1;
  cin >> t;
  while (t--) solve();
}