#include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <vector>

using namespace std;

typedef long long ll;

const double EPS = 1e-9;
const double PI = acos(-1);

int sign(double x) {
    if (fabs(x) < EPS) {
        return 0;
    } else if (x > 0) {
        return 1;
    } else {
        return -1;
    }
}

int dcmp(double x, double y) {
    return sign(x - y);
}

double cosLaw(double a, double b, double c) {
    return acos((a * a + b * b - c * c) / (2 * a * b));
}

struct Vector;
typedef Vector Point;
struct Line;
struct Segment;
struct Circle;

struct Vector {
    double x;
    double y;

    explicit Vector(double x = 0, double y = 0);

    Vector operator+(const Vector &rhs) const;
    Vector operator-() const;
    Vector operator-(const Vector &rhs) const;
    Vector operator*(double d) const;
    Vector operator/(double d) const;

    bool operator==(const Vector &rhs) const;
    bool operator!=(const Vector &rhs) const;
    bool operator<(const Vector &rhs) const;
    bool operator>(const Vector &rhs) const;
    bool operator<=(const Vector &rhs) const;
    bool operator>=(const Vector &rhs) const;

    friend std::ostream &operator<<(std::ostream &os, const Vector &vector);

    double dot(const Vector &rhs) const;
    double cross(const Vector &rhs) const;
    double length() const;
    double angle() const;
    double angle(const Vector &rhs) const;
    Vector rotate(double rad) const;
    Vector normal() const;
    double getDistanceTo(const Point &rhs) const;
};

struct Segment {
    Point a;
    Point b;

    explicit Segment(double x1 = 0, double y1 = 0, double x2 = 0, double y2 = 0);
    explicit Segment(const Point &a = Point(), const Point &b = Point());

    bool contains(const Point &rhs, bool containsEndPoints = true) const;
    bool intersects(const Segment &rhs, bool containsEndPoints = true) const;
    double length() const;
};

Vector::Vector(double x, double y) : x(x), y(y) {}

Vector Vector::operator+(const Vector &rhs) const {
    return Vector(x + rhs.x, y + rhs.y);
}

Vector Vector::operator-() const {
    return Vector(-x, -y);
}

Vector Vector::operator-(const Vector &rhs) const {
    return *this + -rhs;
}

Vector Vector::operator*(double d) const {
    return Vector(x * d, y * d);
}

Vector Vector::operator/(double d) const {
    return Vector(x / d, y / d);
}


bool Vector::operator==(const Vector &rhs) const {
    return dcmp(x, rhs.x) == 0 && dcmp(y, rhs.y) == 0;
}

bool Vector::operator!=(const Vector &rhs) const {
    return !(rhs == *this);
}

bool Vector::operator<(const Vector &rhs) const {
    if (dcmp(x, rhs.x) != 0) {
        return dcmp(x, rhs.x) < 0;
    } else {
        return dcmp(y, rhs.y) < 0;
    }
}

bool Vector::operator>(const Vector &rhs) const {
    return rhs < *this;
}

bool Vector::operator<=(const Vector &rhs) const {
    return !(rhs < *this);
}

bool Vector::operator>=(const Vector &rhs) const {
    return !(*this < rhs);
}

std::ostream &operator<<(std::ostream &os, const Vector &vector) {
    os << "(" << vector.x << ", " << vector.y << ")";
    return os;
}

double Vector::dot(const Vector &rhs) const {
    return x * rhs.x + y * rhs.y;
}

double Vector::cross(const Vector &rhs) const {
    return x * rhs.y - rhs.x * y;
}

double Vector::length() const {
    return sqrt(dot(*this));
}

double Vector::angle() const {
    return atan2(y, x);
}

double Vector::angle(const Vector &rhs) const {
    return acos(dot(rhs) / length() / rhs.length());
}

Vector Vector::rotate(double rad) const {
    return Vector(x * cos(rad) - y * sin(rad), x * sin(rad) + y * cos(rad));
}

Vector Vector::normal() const {
    double l = length();
    return Vector(-y / l, x / l);
}

double Vector::getDistanceTo(const Point &rhs) const {
    return sqrt(pow(x - rhs.x, 2) + pow(y - rhs.y, 2));
}

Segment::Segment(double x1, double y1, double x2, double y2) : a(x1, y1), b(x2, y2) {}

Segment::Segment(const Point &a, const Point &b) : a(a), b(b) {}

bool Segment::contains(const Point &rhs, bool containsEndPoints) const {
    const Vector &u = a - rhs;
    const Vector &v = b - rhs;
    return sign(u.cross(v)) == 0 && (containsEndPoints ? sign(u.dot(v)) <= 0 : sign(u.dot(v)) < 0);
}

bool Segment::intersects(const Segment &rhs, bool containsEndPoints) const {
    const Vector &u = b - a;
    const Vector &v = rhs.b - rhs.a;
    double c1 = u.cross(rhs.a - a);
    double c2 = u.cross(rhs.b - a);
    double c3 = v.cross(a - rhs.a);
    double c4 = v.cross(b - rhs.a);
    if (containsEndPoints && (!sign(c1) || !sign(c2) || !sign(c3) || !sign(c4))) {
        return contains(rhs.a) || contains(rhs.b) || rhs.contains(a) || rhs.contains(b);
    }
    return sign(c1) * sign(c2) < 0 && sign(c3) * sign(c4) < 0;
}

double Segment::length() const {
    return a.getDistanceTo(b);
}


int main() {
//    freopen("data.in", "r", stdin);

    int q;
    scanf("%d", &q);
    while (q--) {
        int x1, y1;
        int x2, y2;
        scanf("%d%d%d%d", &x1, &y1, &x2, &y2);
        Segment segment1(x1, y1, x2, y2);
        scanf("%d%d%d%d", &x1, &y1, &x2, &y2);
        Segment segment2(x1, y1, x2, y2);
        if (segment1.intersects(segment2)) {
            puts("1");
        } else {
            puts("0");
        }
    }
    return 0;
}


Measured memory_bytes: 3132