#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pll = pair<ll, ll>;
#define drep(i, cc, n) for (ll i = (cc); i <= (n); ++i)
#define rep(i, n) drep(i, 0, n - 1)
#define all(a) (a).begin(), (a).end()
#define pb push_back
#define fi first
#define se second

const ll MOD = 1000000007;
const ll MOD2 = 998244353;
const ll INF = 1LL << 60;
const ll MAX_N = 2e5;

void solve(){
    ll a, b, c, d;
    cin >> a >> b >> c >> d;

    //c < dを仮定
    if(c > d){
        swap(a, b);
        swap(c, d);
    }

    if(a <= c && b <= d){
        if(a < b){
            cout << c-a+d-b << "\n";
        }else{
            cout << c+d-b+1 << "\n";
        }
    }else if(a <= c && d < b){
        if(a==1){
            cout << c+d+3 << "\n";
        }else{
            cout << c+d+2 << "\n";
        }
    }else if(c < a && b <= d){
        cout << 1+c+d-b << "\n";
    }else if(c < a && d < b){
        cout << c+d+2 <<"\n";
    }

    return;
}

int main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    
    ll t;
    cin >> t;
    rep(i, t) solve();
}