#include <cstdio>
#include <iostream>
#include <cmath>
#include <cstring>
#include <algorithm>
#include <vector>
#include <set>
#include <queue>
#include <deque>
#include <utility>
using namespace std;
#define EPS 1e-8
#define double long double

struct Vector {
	long long x, y;
	inline Vector() {

	}
	inline Vector(long long x, long long y) {
		this->x = x;
		this->y = y;
	}
	inline Vector operator - (const Vector &a)const {
		return (Vector) {
			x - a.x, y - a.y
		};
	}
	inline long long operator * (const Vector &a)const {
		return x * a.x + y * a.y;
	}
	inline long long operator ^ (const Vector &a)const {
		return x * a.y - y * a.x;
	}
	inline double dis() {
		return std::sqrt(x * x + y * y);
	}
	inline int operator == (Vector a) {
		return a.x == x && a.y == y;
	}
};

inline int sign(long long a) {
	if (a == 0)
		return 0;
	return a > 0 ? 1 : -1;
}

inline int in(Vector a, Vector p, Vector q) {
	if (((p - a) ^ (q - a)))
		return 0;
	return ((p - a) * (q - a)) < 0;
}

inline int check(Vector a, Vector b, Vector c, Vector d) {
//	cout << a.x << ' ' << a.y << endl;
//	cout << b.x << ' ' << b.y << endl;
//	cout << c.x << ' ' << c.y << endl;
//	cout << d.x << ' ' << d.y << endl;
//	cout << sign ((d - c) ^ (b - a)) << endl;
	if (!sign((d - c) ^ (b - a))) {
		if (in(a, c, d) || in(b, c, d) || in(c, a, b) || in(d, a, b)) {
			return 1;
		}
		return 0;
	}
	int cc = sign((c - a) ^ (c - b));
	int dd = sign((d - a) ^ (d - b));
	int aa = sign((a - c) ^ (a - d));
	int bb = sign((b - c) ^ (b - d));
	return  cc != dd &&  aa != bb;
}

int main() {
	//freopen("1.in", "r", stdin);
	int $;
	scanf("%d", &$);
	while ($--) {
		Vector a;
		Vector b;
		Vector c1;
		Vector c2;
		Vector d1;
		Vector d2;
		scanf("%lld%lld%lld%lld%lld%lld%lld%lld%lld%lld%lld%lld", &a.x, &a.y, &b.x, &b.y, &c1.x, &c1.y, &c2.x, &c2.y, &d1.x,
		      &d1.y, &d2.x, &d2.y);

		//	cout << check(c1, c2, d1, d2) << endl;

		if (!check(a, b, c1, c2) && !check(a, b, d1, d2)) {
			puts("0");
		} else if (c1 == d1 || c2 == d1 || c1 == d2 || c2 == d2) {
			puts("1");
		} else if (!check(c1, c2, d1, d2)) {
			puts("1");
		} else if (check(a, b, c1, c2) + check(a, b, d1, d2) == 1) {
			puts("1");
		} else if (!sign((b - a) ^ (c2 - c1)) || !sign((b - a) ^ (d2 - d1))) {
			puts("1");
		} else {
			Vector a0(0, 0), a1(0, 0);
			Vector b0(0, 0), b1(0, 0);
			if (!check(a, c1, d1, d2)) {
				a0 = c1;
			} else {
				a0 = c2;
			}
			if (!check(a, d1, c1, c2)) {
				a1 = d1;
			} else {
				a1 = d2;
			}
			if (!check(b, c1, d1, d2)) {
				b0 = c1;
			} else {
				b0 = c2;
			}
			if (!check(b, d1, c1, c2)) {
				b1 = d1;
			} else {
				b1 = d2;
			}
//			printf("%lf %lf %lf %lf\n", dis(a, b, b1), dis(a0, b, b1), dis(a, b, b0), dis(a1, b, b0));
			int ans = 2;
			if(check(a,b,b1,a0))ans=1;
			else
			if (!sign((b - a) ^ (b1 - a0))) {
				long long w1 = (b - a) * (b - a);
				long long w2 = (b1 - a0) * (b1 - a0);
				if (w1 > w2)
					ans = 1;
			} else {
				//cout<<((b - a) ^ (b1 - a0) )<<endl;

				if (((b - a) ^ (b1 - a0) ) > 0) {
					if(((b-a)^(a0-a))>0)
					{
						if (((b1 - b) ^ (a0 - a) ) < 0)
							ans = 1;
					}
					else
					if (((b1 - b) ^ (a0 - a) ) > 0)
							ans = 1;

				} else {
					if(((b-a)^(a0-a))<0)
					{
						if (((b1 - b) ^ (a0 - a) ) > 0)
							ans = 1;
					}
					else
					if (((b1 - b) ^ (a0 - a) ) < 0)
							ans = 1;
				}
			}
			//cout<<a0.x<<' '<<a0.y<<' '<<b1.x<<' '<<b1.y<<endl;
			//cout<<a1.x<<' '<<a1.y<<' '<<b0.x<<' '<<b0.y<<endl;
			//cout << sign((b - a) ^ (a1 - b0)) << endl;
			if(check(a,b,b0,a1))ans=1;
			else 
			if (!sign((b - a) ^ (b0 - a1))) {
				long long w1 = (b - a) * (b - a);
				long long w2 = (b0 - a1) * (b0 - a1);
				if (w1 > w2)
					ans = 1;
			} else {
				if (((b - a) ^ (b0 - a1) ) > 0) {
					if(((b-a)^(a1-a))>0)
					{
					if (((b0 - b) ^ (a1 - a) ) < 0)
						ans = 1;
					}
					else
					if (((b0 - b) ^ (a1 - a) ) > 0)
						ans = 1;
				} else {
					if(((b-a)^(a1-a))<0)
					{
					if (((b0 - b) ^ (a1 - a) ) > 0)
						ans = 1;
					}
					else if (((b0 - b) ^ (a1 - a) ) <0)
						ans = 1;
				}
			}
			printf("%d\n", ans);
		}
	}
	return 0;
}
/*
1
-999999999 999999998
999999999 999999998
-999999998 -999999998 1000000000 1000000000
999999998 -999999998 -1000000000 1000000000
*/