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

#define ll long long
#define ull unsigned long long
#define EPS 1e-6
#define int ll

ll square(int x)
{
    return x * x;
}

void solve()
{
    int x1, y1, z1;
    cin >> x1 >> y1 >> z1;
    int p1, q1;
    cin >> p1 >> q1;
    int x2, y2, z2;
    cin >> x2 >> y2 >> z2;
    int p2, q2;
    cin >> p2 >> q2;
    if((x1 - x2) * p1 + (y1 - y2) * q1 == 0 && (x1 - x2) * p2 + (y1 - y2) * q2)
    {
        cout << 2 << '\n';
        return;
    }
    double xc = (x1 + x2) / 2.0, yc = (y1 + y2) / 2.0;
    double r = sqrt(square(x1 - x2) + square(y1 - y2) + square(z1 - z2)) / 2;
    int b1 = x1 * p1 + y1 * q1, b2 = x2 * p2 + y2 * q2;
    // cerr << b1 << " " << b2 << endl;
    if(p1 * q2 == p2 * q1)
    {
        if(p1 * b2 != p2 * b1)
            cout << 4 << '\n';
        else
            cout << 3 << '\n';
        return;
    }
    double xp = 1.0 * (q2 * b1 - q1 * b2) / (p1 * q2 - p2 * q1);
    double yp = 1.0 * (p2 * b1 - p1 * b2) / (q1 * p2 - q2 * p1);
    if(hypot(xp - xc, yp - yc) <= r)
        cout << 3 << '\n';
    else
        cout << 4 << '\n';
}

signed main()
{
    ios::sync_with_stdio(false);
    cin.tie(0), cout.tie(0);
    int t;
    cin >> t;
    while (t--)
    {
        solve();
    }
}