#include <bits/stdc++.h>
using namespace std;
// #include <atcoder/modint>
// using namespace atcoder;
// using mint = modint998244353;
using ll = long long;
#define fix(x) fixed << setprecision(x)
#define rep(i, n) for(int i = 0; i < n; ++i)
#define all(x) (x).begin(),(x).end()
template<class T>bool chmin(T&a, const T&b){if(a>b){a=b;return 1;}return 0;}
template<class T>bool chmax(T&a, const T&b){if(a<b){a=b;return 1;}return 0;}
constexpr ll INFLL = (1LL << 62), MOD = 998244353;
constexpr int INF = (1 << 30);

int main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    int t;
    cin >> t;
    while(t--){
        ll a,b,c,d;
        cin >> a >> b >> c >> d;
        if(b>d){
            swap(a,c); swap(b,d);
        }
        ll ans = 0;
        while(b<d && (a>>min<ll>(63,b))!=(c>>min<ll>(63,d))){
            ++b;
            ++ans;
        }
        if((a>>min<ll>(63,b))!=(c>>min<ll>(63,d))){
            ll k = INFLL;
            rep(i,61){
                chmin(k,i*2+abs((a>>min<ll>(63,b+i))-(c>>min<ll>(63,d+i))));
            }
            ans += k;
        }else ans += abs(b-d);
        cout << ans << '\n';
    }
    return 0;
}