#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

using namespace std;

using Int = long long;

template <class T1, class T2> ostream &operator<<(ostream &os, const pair<T1, T2> &a) { return os << "(" << a.first << ", " << a.second << ")"; };
template <class T> ostream &operator<<(ostream &os, const vector<T> &as) { const int sz = as.size(); os << "["; for (int i = 0; i < sz; ++i) { if (i >= 256) { os << ", ..."; break; } if (i > 0) { os << ", "; } os << as[i]; } return os << "]"; }
template <class T> void pv(T a, T b) { for (T i = a; i != b; ++i) cerr << *i << " "; cerr << endl; }
template <class T> bool chmin(T &t, const T &f) { if (t > f) { t = f; return true; } return false; }
template <class T> bool chmax(T &t, const T &f) { if (t < f) { t = f; return true; } return false; }
#define COLOR(s) ("\x1b[" s "m")

inline int sig(Int r) { return (r < 0) ? -1 : (r > 0) ? +1 : 0; }
inline Int sq(Int r) { return r * r; }
struct Pt {
  Int x, y;
  Pt() : x(0), y(0) {}
  Pt(Int x_, Int y_) : x(x_), y(y_) {}
  Pt operator+(const Pt &a) const { return Pt(x + a.x, y + a.y); }
  Pt operator-(const Pt &a) const { return Pt(x - a.x, y - a.y); }
  Pt operator*(const Pt &a) const { return Pt(x * a.x - y * a.y, x * a.y + y * a.x); }
  Pt operator+() const { return Pt(+x, +y); }
  Pt operator-() const { return Pt(-x, -y); }
  Pt operator*(const Int &k) const { return Pt(x * k, y * k); }
  Pt operator/(const Int &k) const { return Pt(x / k, y / k); }
  friend Pt operator*(const Int &k, const Pt &a) { return Pt(k * a.x, k * a.y); }
  Pt &operator+=(const Pt &a) { x += a.x; y += a.y; return *this; }
  Pt &operator-=(const Pt &a) { x -= a.x; y -= a.y; return *this; }
  Pt &operator*=(const Pt &a) { return *this = *this * a; }
  Pt &operator*=(const Int &k) { x *= k; y *= k; return *this; }
  Pt &operator/=(const Int &k) { x /= k; y /= k; return *this; }
  Int abs2() const { return x * x + y * y; }
  Int dot(const Pt &a) const { return x * a.x + y * a.y; }
  Int det(const Pt &a) const { return x * a.y - y * a.x; }
  bool operator==(const Pt &a) const { return (x == a.x && y == a.y); }
  bool operator!=(const Pt &a) const { return !(x == a.x && y == a.y); }
  bool operator<(const Pt &a) const { return ((x != a.x) ? (x < a.x) : (y < a.y)); }
  friend ostream &operator<<(ostream &os, const Pt &a) { os << "(" << a.x << ", " << a.y << ")"; return os; }
};
inline Int tri(const Pt &a, const Pt &b, const Pt &c) { return (b - a).det(c - a); }

// intersection = a + (numer/denom) (b - a)
pair<Int, Int> pLLRate(const Pt &a, const Pt &b, const Pt &c, const Pt &d) {
  const Pt ab = b - a, cd = d - c;
  return make_pair((c - a).det(cd), ab.det(cd));
}


Pt A[2], N[2];
Int Z[2];

int solve() {
  {
    bool ok = true;
    for (int u = 0; u < 2; ++u) {
      ok = ok && ((A[1] - A[0]).dot(N[u]) == 0);
    }
    if (ok) return 2;
  }
  if (N[0].det(N[1])) {
    {
      const auto res = pLLRate(A[0], A[0] + N[0] * Pt(0, 1), A[1], A[1] + N[1] * Pt(0, 1));
      for (int u = 0; u < 2; ++u) {
        A[u] *= res.second;
        Z[u] *= res.second;
        N[u] *= res.second;
      }
    }
    const auto res = pLLRate(A[0], A[0] + N[0] * Pt(0, 1), A[1], A[1] + N[1] * Pt(0, 1));
    auto dir = N[0] * Pt(0, 1);
    dir *= res.first;
    assert(dir.x % res.second == 0);
    assert(dir.y % res.second == 0);
    dir /= res.second;
    const Pt B = A[0] + dir;
cerr<<"A = "<<A[0]<<", "<<A[1]<<", B = "<<B<<endl;
    if (B == A[0] && B == A[1]) {
      assert(false);
    } else if (B == A[0] || B == A[1]) {
      if (Z[0] != Z[1]) return 3;
    } else {
      const Int c = (B - A[0]).dot(B - A[1]) + (0 - Z[0]) * (0 - Z[1]);
      const Int b = ((0 - Z[0]) + (0 - Z[1]));
      const Int a = 1;
cerr<<__LINE__<<": "<<a<<" "<<b<<" "<<c<<"; "<<b*b-4*a*c<<endl;
      if ((__int128)b*b - (__int128)4*a*c >= 0) return 3;
    }
  }
  return 4;
}

int main() {
  for (int numCases; ~scanf("%d", &numCases); ) { for (int caseId = 1; caseId <= numCases; ++caseId) {
    for (int u = 0; u < 2; ++u) {
      scanf("%lld%lld%lld%lld%lld", &A[u].x, &A[u].y, &Z[u], &N[u].x, &N[u].y);
    }
    
    const int ans = solve();
    printf("%d\n", ans);
  }
#ifndef LOCAL
  break;
#endif
  }
  return 0;
}