/*
TASK: mov
LANG: C++
*/

#include <stdio.h>
#include <math.h>

using namespace std;

typedef struct {
    long x;
    long y;
} point;

point operator-(const point a, const point b) {
    point c = a;
    c.x -= b.x;
    c.y -= b.y;
    return c;
}

point operator+(const point a, const point b) {
    point c = a;
    c.x += b.x;
    c.y += b.y;
    return c;
}

point a, b, c, d, v;
point dp, cpab, cpcd;

int t;
double len = .0, oldlen = .0;
double vx, vy;

void read () {
    scanf ("%ld %ld %ld %ld", &a.x, &a.y, &b.x, &b.y);
    scanf ("%ld %ld %ld %ld", &c.x, &c.y, &d.x, &d.y);
    scanf ("%ld %ld", &v.x, &v.y);
    vx = v.x;
    vy = v.y;
    len = sqrt(vx * vx + vy * vy);
    vx /= len;
    vy /= len;
}

double det (point i, point j, point k) {
    // | ix iy 1 | ix iy |
    // | jx jy 1 | jx jy |
    // | kx ky 1 | kx ky |
    return ((i.x * j.y + i.y * k.x + j.x * k.y) - (j.y * k.x + i.x * k.y + i.y * j.x));
}

int process () {
    double d1, d2;
    dp.x = (a.x > b.x) ? b.x : a.x;
    dp.y = (a.y > b.y) ? b.y : a.y;
    a = a - dp;
    b = b - dp;
    c = c - dp;
    d = d - dp;
    d1 = det(a, b, c);
    d2 = det(a, b, d);
    if (d1 > 0 && d2 < 0) return 1;
    else if (d1 < 0 && d2 > 0) return 1;
    len = (1 << 30) * 1.;
    do {
        cpab.x = (a.x + b.x) / 2;
        cpab.y = (a.y + b.y) / 2;
        cpcd.x = (c.x + d.x) / 2;
        cpcd.y = (c.y + d.y) / 2;
        dp = cpcd - cpab;
        oldlen = len;
        len = sqrt(dp.x * dp.x + dp.y * dp.y);
        if (oldlen < len) {
            return 0;
        }
        vx *= len / 2;
        vy *= len / 2;
        c.x -= long(vx);
        c.y -= long(vy);
        d.x -= long(vx);
        d.y -= long(vy);
        d1 = det(a, b, c);
        d2 = det(a, b, d);
        if (d1 > 0 && d2 < 0) return 1;
        else if (d1 < 0 && d2 > 0) return 1;
    } while (oldlen > len);
    return 0;
}

int main () {
    int i;
    scanf ("%d", &t);
    for (i = 0; i < t; i ++) {
        read();
        printf ("%d", process());
    }
    printf ("\n");
    return 0;
}
