#include <bits/stdc++.h>

#pragma GCC optimize("Ofast")
using namespace std;

void solve(int cs) {
  set<int> st;
  for (int i = 0; i < 3; i++) {
    int x;
    cin >> x;
    st.insert(x);
  }
  if (st.size() == 3) {
    vector<int> a (st.begin(), st.end());
    int f = min(a[1] - a[0], a.back() - a[1]);
    int g = max(a[1] - a[0], a.back() - a[1]);
    int gc = __gcd(f, g);
    cout << (f / gc) + (g / gc) << "\n";
  }
  else if (st.size() == 2) cout << 1 << "\n";
  else cout << 0 << "\n";
}

int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  int tc = 1;
  cin >> tc;
  for (int cs = 1; cs <= tc; cs++) {
    solve(cs);
  }
  return 0;
}