#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) {
return ((p - a) * (q - a)) < 0;
}
inline int check(Vector a, Vector b, Vector c, Vector d) {
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;
}
inline double dis(Vector x, Vector a, Vector b) {
double len = (a - b) * (x - b) / std::sqrt((a - b).dis());
return (x - b).dis() - len * len ;
}
int main() {
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);
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 (!sign((d2 - d1) ^ (c2 - c1))) {
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 (!sign((b - a) ^ (a0 - b)));
else {
double k1 = (b - a) * (a0 - a) * 1.0
double c1=((a0 - a) * (a0 - a))*1.0 ;
k1/=c1;
double k2 = ((b - a) * (b1 - b)) * 1.0 ;
double c2= ((b1 - b) * (b1 - b))*1.0;
k2/=c2;
//cout << k1 << ' ' << k2 << endl;
if (k1 > k2)
ans = 1;
}
//cout << sign((b - a) ^ (a1 - b0)) << endl;
if (!sign((b - a) ^ (a1 - b0)));
else {
double k1 = (b - a) * (a1 - a) * 1.0
double c1=((a1 - a) * (a1 - a))*1.0 ;
k1/=c1;
double k2 = ((b - a) * (b0 - b)) * 1.0 ;
double c2= ((b0 - b) * (b0 - b))*1.0;
k2/=c2;
if (k1 > k2)
ans = 1;
}
printf("%d\n", ans);
}
}
return 0;
}
/*
1
-999999999 999999998
999999999 999999998
-999999998 -999999998 1000000000 1000000000
999999998 -999999998 -1000000000 1000000000
*/