#include<cstdio>
#include<vector>
#include<map>
#include<algorithm>
#define int long long
using namespace std;
int x[5],y[5];
bool Swap(int &a,int &b){a^=b^=a^=b;return true;}
int read(){
	char ch=getchar();int nn=0,ssss=1;
	while(ch<'0'||ch>'9'){if(ch=='-')ssss*=-1;ch=getchar();}
	while(ch>='0'&&ch<='9'){nn=nn*10+(ch-'0');ch=getchar();}
	return nn*ssss;
}
#define p1x(xx,yy) (((xx)==x[1]||(xx)==x[2])&&(yy)>=y[1]&&(yy)<=y[2])
#define p1y(xx,yy) (((yy)==y[1]||(yy)==y[2])&&(xx)>=x[1]&&(xx)<=x[2])
#define in1(xx,yy) (p1x(xx,yy)||p1y(xx,yy))
#define p2x(xx,yy) (((xx)==x[3]||(xx)==x[4])&&(yy)>=y[3]&&(yy)<=y[4])
#define p2y(xx,yy) (((yy)==y[3]||(yy)==y[4])&&(xx)>=x[3]&&(xx)<=x[4])
#define in2(xx,yy) (p2x(xx,yy)||p2y(xx,yy))
#define lne(a,b,c) (a>b&&a<c)
int chk(int x1,int y1,int x2,int y2){
	if(x1==x2){
		if(x1==x[1]&&(y1>=y[1]&&y1<=y[2])&&(y2>=y[1]&&y2<=y[2]))return true;
		if(x1==x[2]&&(y1>=y[1]&&y1<=y[2])&&(y2>=y[1]&&y2<=y[2]))return true;
		if(x1==x[3]&&(y1>=y[3]&&y1<=y[4])&&(y2>=y[3]&&y2<=y[4]))return true;
		if(x1==x[4]&&(y1>=y[3]&&y1<=y[4])&&(y2>=y[3]&&y2<=y[4]))return true;
	}
	if(y1==y2){
		if(y1==y[1]&&(x1>=x[1]&&x1<=x[2])&&(x2>=x[1]&&x2<=x[2]))return true;
		if(y1==y[2]&&(x1>=x[1]&&x1<=x[2])&&(x2>=x[1]&&x2<=x[2]))return true;
		if(y1==y[3]&&(x1>=x[3]&&x1<=x[4])&&(x2>=x[3]&&x2<=x[4]))return true;
		if(y1==y[4]&&(x1>=x[3]&&x1<=x[4])&&(x2>=x[3]&&x2<=x[4]))return true;
	}
	return false;
}
bool solve(){
	map<int,vector<int> >mpx,mpy;
	mpx.clear();mpy.clear();
	for(int i=1;i<=4;i++){x[i]=read();y[i]=read();}
	for(int x1=1;x1<=4;x1++)
		for(int y1=1;y1<=4;y1++){
			mpx[x[x1]].push_back(y[y1]);
			mpy[y[y1]].push_back(x[x1]);
		}
	int lst=-1,cnt=0,ce=0;
	for(map<int,vector<int> >::iterator it1=mpx.begin();it1!=mpx.end();it1++){
		if(it1->first==lst)continue;lst=it1->first;
		vector<int>vec=it1->second;
		sort(vec.begin(),vec.end());
		int ll=-1;
		for(vector<int>::iterator it=vec.begin();it!=vec.end();it++){
			if(!(in1(lst,*it)||in2(lst,*it)))continue;
			if(*it==ll)continue;cnt++;if(ll==-1){ll=*it;continue;}
			if(chk(lst,ll,lst,*it))ce++;
			ll=*it;
		}
	}
	lst=-1;
	for(map<int,vector<int> >::iterator it1=mpy.begin();it1!=mpy.end();it1++){
		if(it1->first==lst)continue;lst=it1->first;
		vector<int>vec=it1->second;
		sort(vec.begin(),vec.end());
		int ll=-1;
		for(vector<int>::iterator it=vec.begin();it!=vec.end();it++){
			if(!(in1(*it,lst)||in2(*it,lst)))continue;
			if(*it==ll)continue;if(ll==-1){ll=*it;continue;}
			if(chk(ll,lst,*it,lst))ce++;
			ll=*it;
		}
	}
	int ans=ce-cnt+2;
	if(x[2]<x[3]||x[1]>x[4]||y[2]<y[3]||y[1]>y[4])ans++;
	if(lne(x[1],x[3],x[4])&&lne(x[2],x[3],x[4])&&lne(y[1],y[3],y[4])&&lne(y[2],y[3],y[4]))ans++;
	if(lne(x[3],x[1],x[2])&&lne(x[4],x[1],x[2])&&lne(y[3],y[1],y[2])&&lne(y[4],y[1],y[2]))ans++;
	printf("%d\n",ans);
	return true;
}
signed main(){
//	freopen("data.in","r",stdin);
	int T=read();
	while(T--)solve();
}