#include <iostream>
#include <algorithm>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
using ll = long long;
//#define endl "\n";
int main(){
    ll Q;
    cin >> Q;
    vector<ll> pow2(69, 0);
    pow2[0] = 1;
    for(int i = 0; i < 60; i++) pow2[i + 1] = pow2[i] * 2;
    for(int q = 1; q <= Q; q++){
        ll sx, sy, tx, ty;
        cin >> sx >> sy >> tx >> ty;
        if(sy >= 60 && ty >= 60){
            cout << abs(sy - ty) << endl;
            continue;
        }
        ll ans = 3e18;
        for(ll i = 0; i <= 60; i++){
            ll posx = sx / pow2[i];
            ll posy = tx / pow2[i];
            //cout << i << " " << abs(sy - i) << " " << abs(ty - i) << " " << abs(posx - posy) << endl;
            ans = min(ans, abs(sy - i) + abs(ty - i) + abs(posx - posy));
        }
        cout << ans << endl;
    }
    return 0;
}