#include <bits/stdc++.h>
using namespace std;

typedef long long ll;

struct Point {
    ll x, y;
    Point() = default;
    Point(ll x_, ll y_): x(x_), y(y_) {}

    friend Point operator-(Point A, Point B) {return Point(A.x-B.x, A.y-B.y);}

    friend ll operator*(Point A, Point B) {return A.x*B.x + A.y*B.y;}

    bool operator==(Point X) {return x == X.x && y == X.y;}

    void input() {
        scanf("%lld%lld", &x, &y);
    }
};


bool graph[100][100];
bool vis[10005];
const int MX = 9;
int fx[4][2] = {{-1,0}, {0,-1}, {0,1}, {1,0}};

bool check_in_zone(int x, int y) {
    if (x<=0 || x>=MX) return false;
    if (y<=0 || y>=MX) return false;
    return true;
}

int id(int x, int y) {
    return x*MX + y;
}

pair<int, int> coor(int v) {
    return {v/MX, v%MX};
}

void dfs(int u) {
    vis[u] = 1;
    auto [x, y] = coor(u);
    //printf("%d %d\n", x, y);
    for (int f=0; f<4; f++) {
        int nx = x+fx[f][0];
        int ny = y+fx[f][1];
        if (!check_in_zone(nx, ny)) continue;
        int v = id(nx, ny);
        if (!vis[v] && graph[u][v]) dfs(v);
    }
}

void solve()
{
    Point p[4];
    map<int, int> mp[2];
    int mpcnt[2] = {0};
    for (int i=0; i<4; i++) {
        p[i].input();
        mp[0][p[i].x] = 0;
        mp[1][p[i].y] = 0;
    }
    for (auto &[_, v]: mp[0]) v = (++mpcnt[0])+1;
    for (auto &[_, v]: mp[1]) v = (++mpcnt[1])+1;
    for (int i=0; i<4; i++) {
        p[i].x = mp[0][p[i].x];
        p[i].y = mp[1][p[i].y];
        //printf("%lld %lld\n", p[i].x, p[i].y);
    }
    //puts(".....");

    memset(graph, 0, sizeof(graph));
    memset(vis, 0, sizeof(vis));
    for (int i=1; i<MX; i++) {
        for (int j=1; j<MX; j++) {
            for (int f=0; f<4; f++) {
                auto [nx, ny] = pair<int, int>(i+fx[f][0], j+fx[f][1]);
                if (!check_in_zone(nx, ny)) continue;
                graph[id(i, j)][id(nx, ny)] = 1;
                graph[id(nx, ny)][id(i, j)] = 1;
            }
        }
    }

    for (int _=0; _<=2; _+=2) {
        Point LD = p[_];
        Point RU = p[_+1];
        for (int x=LD.x; x<RU.x; x++) {
            int y = LD.y;
            graph[id(x, y)][id(x, y-1)] = 0;
            graph[id(x, y-1)][id(x, y)] = 0;
            y = RU.y;
            graph[id(x, y)][id(x, y-1)] = 0;
            graph[id(x, y-1)][id(x, y)] = 0;
        }
        for (int y=LD.y; y<RU.y; y++) {
            int x = LD.x;
            graph[id(x, y)][id(x-1, y)] = 0;
            graph[id(x-1, y)][id(x, y)] = 0;
            x = RU.x;
            graph[id(x, y)][id(x-1, y)] = 0;
            graph[id(x-1, y)][id(x, y)] = 0;
        }
    }

    int ans = 0;

    for (int i=1; i<MX; i++) for (int j=1; j<MX; j++) if (!vis[id(i, j)]) {
        ans++;
        dfs(id(i, j));
        //puts("");
    }

    printf("%d\n", ans);
}



int main()
{
    int ttt;
    scanf("%d", &ttt);
    while (ttt--) {
        solve();
    }
    return 0;
}