#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

void solve()
{
  long long x[2], y[2];
  for (int i = 0; i < 2; ++i) cin >> x[i] >> y[i];
  if (max(y[0], y[1]) >= 60)
  {
    cout << abs(y[0] - y[1]) << endl;
    return;
  }
  long long ans = 1e18;
  for (int d = max(y[0], y[1]); d <= 60; ++d)
  {
    long long xid[2] = {x[0] >> d, x[1] >> d};
    long long tmp = abs(xid[0] - xid[1]) + 2 * d - y[0] - y[1];
    ans = min(ans, tmp); 
  }
  cout << ans << endl;
}

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