#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back

struct pt{
	ll x,y;

	pt():x(0),y(0){}
	pt(ll a,ll b):x(a),y(b){}
};

pt operator - (pt a,pt b){return pt(a.x-b.x,a.y-b.y);}
pt operator + (pt a,pt b){return pt(a.x+b.x,a.y+b.y);}

ll cross(pt a,pt b){return a.x*b.y-a.y*b.x;}
ll dot(pt a,pt b){return a.x*b.x+a.y*b.y;}
int sgn(ll x){return x==0?0:(x<0?-1:1);}

bool OnSeg(pt A,pt B,pt C){
	pt v=B-A;
	ll da=dot(v,A);
	ll dc=dot(v,C);
	ll db=dot(v,B);
	return da<=dc && dc<=db;
}

bool Good(pt A,pt B,pt C,pt D){
	return sgn(cross(B-A,C-A))*sgn(cross(B-A,D-A))==-1;
}

bool SegInter(pt A,pt B,pt C,pt D){
	if(Good(A,B,C,D) && Good(C,D,A,B))return true;
	if(OnSeg(A,B,C) || OnSeg(A,B,D) || OnSeg(C,D,A) || OnSeg(C,D,B))return true;
	return false;
}

bool RayInter(pt A,pt B,pt C,pt D){
	return cross(B-A,D-C)>0;
}

pair<pt,pt> Tangents(pt A,pt B,vector<pt> pts){
	vector<pt> L,R;
	for(pt p:pts){
		if(cross(B-A,p-A)>0)L.pb(p);
		else R.pb(p);
	}
	pt bestL=L[0];
	for(int i=1;i<L.size();i++){
		if(cross(L[i]-A,bestL-A)<0){
			bestL=L[i];
		}
	}
	pt bestR=R[0];
	for(int i=1;i<R.size();i++){
		if(cross(R[i]-A,bestR-A)>0){
			bestR=R[i];
		}
	}
	//printf("tangents (%lld, %lld) (%lld, %lld)\n",bestL.x,bestL.y,bestR.x,bestR.y);
	return {bestL,bestR};
}

pt read(){
	int x,y;
	scanf("%i %i",&x,&y);
	return pt(x,y);
}

void Solve(){
	pt A=read();
	pt B=read();
	pt C=read();
	pt D=read();
	pt E=read();
	pt F=read();

	bool sec1=SegInter(A,B,C,D);
	bool sec2=SegInter(A,B,E,F);

	bool pos=false,neg=false;
	vector<pt> pts={C,D,E,F};
	for(pt p:pts){
		ll cr=cross(B-A,p-A);
		if(cr<0)neg=true;
		if(cr>0)pos=true;
	}

	if(!sec1 && !sec2)printf("0\n");
	else if(!sec1 || !sec2)printf("1\n");
	else if(!pos || !neg)printf("1\n");
	else{
		pair<pt,pt> tg1=Tangents(A,B,pts);
		pair<pt,pt> tg2=Tangents(B,A,pts);
		if(RayInter(A,tg1.first,B,tg2.second)
			|| RayInter(B,tg2.first,A,tg1.second)){
			printf("1\n");
		}else{
			printf("2\n");
		}
	}
}
int main(){
	int t;
	scanf("%i",&t);
	while(t--){
		Solve();
	}
	return 0;
}