#include <bits/stdc++.h>

using namespace std;

#define all(x) (x).begin(), (x).end()
using vi = vector<int>;
using pii = array<int, 2>;
using ll = long long;

template<class T>
struct vec {
    T x, y, z;
    using v = vec<T>;
    vec(T x, T y, T z) : x(x), y(y), z(z) {}
    T dot(v b) { return x * b.x + y * b.y + z * b.z; }
    vec operator+(v b) {return v(x + b.x, y + b.y, z + b.z); }
    vec operator-(v b) {return v(x - b.x, y - b.y, z - b.z); }
    vec cross(v b) { return v(y * b.z - z * b.y, -(x * b.z - z * b.x), x * b.y - y * b.x); }
    vec cross(v a, v b) { return (a - *this).cross(b - *this); }
    bool isnull() { return x == 0 && y == 0 && z == 0; }
};

using vec3d = vec<ll>;

bool online(vec3d p, vec3d a, vec3d b) {
    return a.cross(p, b).isnull();
}

void solve() {
    pii x, y, z, p, q, d;
    for (int i : {0, 1}) {
        cin >> x[i] >> y[i] >> z[i] >> p[i] >> q[i];
        d[i] = -(p[i] * x[i] + q[i] * y[i]);
    }
    vec3d a(p[0], q[0], 0), b(p[1], q[1], 0), e(x[0], y[0], z[0]), f(x[1], y[1], z[1]);
    if (p[0] * x[1] + q[0] * y[1] + d[0] == 0 &&p[1] * x[0] + q[1] * y[0] + d[1] == 0){
        cout << "2\n";
    }
    else  if (p[0] * x[1] + q[0] * y[1] + d[0] == 0) {
        if (a.dot(b) == 0) {
            cout << (online(e, f, f + b) ? 4 : 3) << '\n';
        } else {
            cout << (a.cross(b).isnull() ? 2 : 3) << '\n';
        }
    } else if (p[1] * x[0] + q[1] * y[0] + d[1] == 0) {
        if (a.dot(b) == 0) {
            cout << (online(f, e, e + a) ? 4 : 3) << '\n';
        } else {
            cout << (a.cross(b).isnull() ? 2 : 3) << '\n';
        }
    } else if (a.dot(b) == 0) {
        cout << 3 << '\n';
    } else if (a.cross(b).isnull()) {
        cout << 4 << '\n';
    } else {
        cout <<4 << '\n';
    }
}

int main() {
    int t;
    cin >> t;
    while (t--) {
        solve();
    }
}