#include <iostream>
#include <iomanip>
#include <algorithm>
#include <cmath>

#define EPS (1e-10)
#define equals(a, b) (fabs((a) - (b)) < EPS)

using namespace std;

static const int COUNTER_CLOCKWISE = 1;
static const int CLOCKWISE = -1;
static const int ONLINE_BACK = 2;
static const int ONLINE_FRONT = -2;
static const int ON_SEGMENT = 0;

class Point {
public:
	double x, y;
	Point(double x = 0, double y = 0) : x(x), y(y) {}

	Point operator + (Point p) { return Point(x + p.x, y + p.y); }
	Point operator - (Point p) { return Point(x - p.x, y - p.y); }
	Point operator * (double a) { return Point(a*x, a*y); }
	Point operator / (double a) { return Point(x / a, y / a); }

	double norm() { return x*x + y*y; }
	double abs() { return sqrt(norm()); }

	bool operator < (const Point &p) const {
		return x != p.x ? x < p.x : y < p.y;
	}

	bool operator == (const Point &p) const {
		return fabs(x - p.x) < EPS && fabs(y - p.y) < EPS;
	}
};

typedef Point Vector;

struct Segment {
	Point p1, p2;
	Segment() {}
};

typedef Segment Line;

class Circle {
public:
	Point c;
	double r;
	Circle(Point c = Point(), double r = 0.0) : c(c), r(r) {}
};


double norm(Vector a) {
	return a.norm();
}

double abs(Vector a) {
	return a.abs();
}

double dot(Vector a, Vector b) {
	return a.x*b.x + a.y*b.y;
}

double cross(Vector a, Vector b) {
	return a.x*b.y - a.y*b.x;
}

bool isOrthogonal(Vector a, Vector b) {
	return equals(dot(a, b), 0.0);
}

bool isOrthogonal(Point a1, Point a2, Point b1, Point b2) {
	return isOrthogonal(a1 - a2, b1 - b2);
}

bool isOrthogonal(Segment s1, Segment s2) {
	return isOrthogonal(s1.p1, s1.p2, s2.p1, s2.p2);
}

bool isParallel(Vector a, Vector b) {
	return equals(cross(a, b), 0.0);
}

bool isParallel(Point a1, Point a2, Point b1, Point b2) {
	return isParallel(a1 - a2, b1 - b2);
}

bool isParallel(Segment s1, Segment s2) {
	return isParallel(s1.p1, s1.p2, s2.p1, s2.p2);
}

Point project(Segment s, Point p) {
	double alpha = dot(p - s.p2, s.p1 - s.p2) / (s.p1 - s.p2).norm();
	return s.p2 + (s.p1 - s.p2)*alpha;
}

Point reflect(Segment s, Point p) {
	return project(s, p)*2.0 - p;
}

int ccw(Point p0, Point p1, Point p2) {
	Vector a = p1 - p0;
	Vector b = p2 - p0;
	if (cross(a, b) > EPS) return COUNTER_CLOCKWISE;
	if (cross(a, b) < -EPS) return CLOCKWISE;
	if (dot(a, b) < -EPS) return ONLINE_BACK;
	if (a.norm() < b.norm()) return ONLINE_FRONT;
	return ON_SEGMENT;
}

bool intersect(Point p1, Point p2, Point p3, Point p4) {
	int p1p2p3, p1p2p4, p3p4p1, p3p4p2;
	p1p2p3 = ccw(p1, p2, p3);
	p1p2p4 = ccw(p1, p2, p4);
	p3p4p1 = ccw(p3, p4, p1);
	p3p4p2 = ccw(p3, p4, p2);

	if (p1p2p3 == ON_SEGMENT) return true;
	if (p1p2p4 == ON_SEGMENT) return true;
	if (p3p4p1 == ON_SEGMENT) return true;
	if (p3p4p2 == ON_SEGMENT) return true;
	if (p1p2p3 == ONLINE_FRONT && p1p2p4 == ONLINE_BACK) return true;
	if (p1p2p3 == ONLINE_BACK && p1p2p4 == ONLINE_FRONT) return true;
	if (p1p2p3 == COUNTER_CLOCKWISE && p1p2p4 == CLOCKWISE && p3p4p1 == CLOCKWISE && p3p4p2 == COUNTER_CLOCKWISE) return true;
	if (p1p2p3 == CLOCKWISE && p1p2p4 == COUNTER_CLOCKWISE && p3p4p1 == COUNTER_CLOCKWISE && p3p4p2 == CLOCKWISE) return true;
	return false;
}

bool intersect(Segment s1, Segment s2) {
	return intersect(s1.p1, s1.p2, s2.p1, s2.p2);
}

//int main() {
//	Segment S1, S2;
//	int q;
//	cin >> q;
//	for (int i = 0; i < q; i++) {
//		cin >> S1.p1.x >> S1.p1.y >> S1.p2.x >> S1.p2.y >> S2.p1.x >> S2.p1.y >> S2.p2.x >> S2.p2.y;
//		cout << fixed << setprecision(15);
//		cout << distSegSeg(S1, S2) << endl;
//	}
//
//	return 0;
//}

int main() {
	Segment S1, S2;
	int q;
	cin >> q;
	for (int i = 0; i < q; i++) {
		cin >> S1.p1.x >> S1.p1.y >> S1.p2.x >> S1.p2.y >> S2.p1.x >> S2.p1.y >> S2.p2.x >> S2.p2.y;
		cout << fixed << setprecision(15);
		cout << intersect(S1, S2) << endl;
	}

	return 0;
}

Measured memory_bytes: 1232