#include <bits/stdc++.h>
using namespace std;
#define FOR(i,m,n) for(int i=(m);i<(n);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
using ll = long long;
constexpr int INF = 0x3f3f3f3f;
constexpr long long LINF = 0x3f3f3f3f3f3f3f3fLL;
constexpr double EPS = 1e-8;
constexpr int MOD = 998244353;
// constexpr int MOD = 1000000007;
constexpr int DY4[]{1, 0, -1, 0}, DX4[]{0, -1, 0, 1};
constexpr int DY8[]{1, 1, 0, -1, -1, -1, 0, 1};
constexpr int DX8[]{0, -1, -1, -1, 0, 1, 1, 1};
template <typename T, typename U>
inline bool chmax(T& a, U b) { return a < b ? (a = b, true) : false; }
template <typename T, typename U>
inline bool chmin(T& a, U b) { return a > b ? (a = b, true) : false; }
struct IOSetup {
  IOSetup() {
    std::cin.tie(nullptr);
    std::ios_base::sync_with_stdio(false);
    std::cout << fixed << setprecision(20);
  }
} iosetup;

void solve() {
  ll a, b, c, d; cin >> a >> b >> c >> d;
  if (a == c && b == d) {
    cout << 0 << '\n';
    return;
  }
  vector<int> op{0, 0, 1, 1, 2, 3, 4, 5};
  ll ans = LINF;
  do {
    ll x = a, y = b, mv = 0;
    for (const int i : op) {
      if (i <= 1) {
        ++mv;
        (i == 0 ? x : y) = 0;
      } else if (i <= 3) {
        ++mv;
        ++(i == 2 ? x : y);
      } else if (i == 4) {
        if (x > c || (x <= y && y <= c)) break;
        mv += c - x;
        x = c;
      } else if (i == 5) {
        if (y > d || (y <= x && x <= d)) break;
        mv += d - y;
        y = d;
      }
      if (x == y) break;
      if (x == c && y == d) {
        chmin(ans, mv);
        break;
      }
    }
  } while (next_permutation(ALL(op)));
  cout << ans << '\n';
}

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