#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define fi first
#define se second
typedef vector<vector<ll>> Mat;
const int N=1e5+10,mod=998244353,inf=1e9+1;
const double pi=acos(-1.0),esp=1e-9;
const ll INF=8e18;
#define int long long 
struct Point
{
    int x,y;
    Point &operator+=(const Point &T){
        x+=T.x;y+=T.y;
        return *this;
    }
    Point &operator-=(const Point &T){
        x-=T.x;y-=T.y;
        return *this;
    }
    Point &operator*=(const int &T)
    {
        x*=T;y*=T;
        return *this;
    }
    friend Point operator+(Point P1,const Point &P2){
        return P1+=P2;
    }
    friend Point operator-(Point P1,const Point &P2){
        return P1-=P2;
    }
    friend Point operator*(Point P,const int &T)
    {
        return P*=T;
    }
    bool operator<(const Point &t)const{
    	if(x==t.x)return y<t.y;
    	return x<t.x;
    }
    bool operator>(const Point &t)const{
    	if(x==t.x)return y>t.y;
    	return x>t.x;
    }
};
int cross(Point p1,Point p2)
{
    return (p1.x*p2.y)-(p1.y*p2.x);
}
int dot(Point p1,Point p2)
{
  return p1.x * p2.x + p1.y * p2.y;
}
vector<Point> Andrew(vector<Point>t){
	sort(t.begin(),t.end());
	int n=t.size();
	vector<Point>st;
	auto check=[&](Point p){
		Point back1=st.back(),back2=*(st.rbegin()+1);
		return cross(back1-back2,p-back1)<=0;
	};
	for(int i=0;i<n;i++){
		while(st.size()>1&&check(t[i])){
			st.pop_back();
		}
		st.pb(t[i]);
	}
	int k=st.size();
	for(int i=n-2;i>=0;i--){
		while((int)st.size()>k&&check(t[i])){
			st.pop_back();
		}
		st.pb(t[i]);
	}
	if(st.size())st.pop_back();
	return st;
}
void solve(){
	int n;
	cin>>n;
	vector<Point>p(n);
	for(int i=0;i<n;i++)
	cin>>p[i].x>>p[i].y;
	vector<Point>st=Andrew(p),t1;
	 map<Point,int>mp;
	 int ans=0;
	 for(int i=0;i<(int)st.size();i++){
	 	mp[st[i]]=1;
	 	ans+=cross(st[i],st[(i+1)%st.size()]);
	 }
	 if(st.size()==0){
	 	cout<<777<<'\n';
	 	return ;
	 }
	 for(auto x:p){
		 if(mp.count(x))continue;
		 t1.pb(x);
	 }
	 if(t1.size()==0){
	 	cout<<-1<<'\n';
	 	return ;
	 }
	 if(t1.size()==1){
	 	int res=INF;
	 	for(int i=0;i<st.size();i++){
	 		int ii=(i+1)%(st.size());
	 		Point v=st[ii]-st[i];
	 		res=min(res,cross(v,t1[0]-st[i]));
	 	}
	 	cout<<ans-res<<'\n';
	 	return ;
	 }
	 vector<Point>st1=Andrew(t1);
	int j=0,sub=9e18;
	Point v=st[1]-st[0];
	while(cross(v,st1[(j-1+st1.size())%st1.size()]-st[0])
	<cross(v,st1[j]-st[0]))j=(j-1+st1.size())%st1.size();
	for(int i=0;i<(int)st.size();i++)
	{
		int i1=(i+1)%st.size();
		Point v=st[i1]-st[i];
		while(cross(v,st1[(j+1)%st1.size()]-st[i])<cross(v,st1[j]-st[i]))j=(j+1)%st1.size();
		sub=min(sub,cross(v,st1[j]-st[i]));
	}
	 cout<<ans-sub<<'\n';
}
signed main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);cout.tie(0);
    int t=1;
    cin>>t;
    while(t--)
        solve();
    return 0;
}