#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <unordered_set>
using namespace std;
#if __has_include(<atcoder/all>)
#include <atcoder/all>
using namespace atcoder;
#endif
#define GET_MACRO(_1, _2, _3, NAME, ...) NAME
#define _rep(i, n) _rep2(i, 0, n)
#define _rep2(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define rep(...) GET_MACRO(__VA_ARGS__, _rep2, _rep)(__VA_ARGS__)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
using i64 = long long;
template <class T, class U>
bool chmin(T& a, const U& b) {
    return (b < a) ? (a = b, true) : false;
}
template <class T, class U>
bool chmax(T& a, const U& b) {
    return (b > a) ? (a = b, true) : false;
}
inline void YesNo(bool f = 0, string yes = "Yes", string no = "No") {
    std::cout << (f ? yes : no) << "\n";
}
namespace io {
template <typename T>
istream& operator>>(istream& i, vector<T>& v) {
    rep(j, v.size()) i >> v[j];
    return i;
}
template <typename T>
string join(vector<T>& v) {
    stringstream s;
    rep(i, v.size()) s << ' ' << v[i];
    return s.str().substr(1);
}
template <typename T>
ostream& operator<<(ostream& o, vector<T>& v) {
    if (v.size()) o << join(v);
    return o;
}
template <typename T>
string join(vector<vector<T>>& vv) {
    string s = "\n";
    rep(i, vv.size()) s += join(vv[i]) + "\n";
    return s;
}
template <typename T>
ostream& operator<<(ostream& o, vector<vector<T>>& vv) {
    if (vv.size()) o << join(vv);
    return o;
}

template <class T, class U>
istream& operator>>(istream& i, pair<T, U>& p) {
    i >> p.first >> p.second;
    return i;
}

template <class T, class U>
ostream& operator<<(ostream& o, pair<T, U>& p) {
    o << p.first << " " << p.second;
    return o;
}

void print() { cout << "\n"; }

template <class Head, class... Tail>
void print(Head&& head, Tail&&... tail) {
    cout << head << " ";
    print(std::forward<Tail>(tail)...);
}

void in() {}

template <class Head, class... Tail>
void in(Head&& head, Tail&&... tail) {
    cin >> head;
    in(std::forward<Tail>(tail)...);
}

}  // namespace io
using namespace io;

namespace useful {
long long modpow(long long a, long long b, long long mod) {
    long long res = 1;
    while (b) {
        if (b & 1) res *= a, res %= mod;
        a *= a;
        a %= mod;
        b >>= 1;
    }
    return res;
}

bool is_pow2(long long x) { return x > 0 && (x & (x - 1)) == 0; }

template <class T>
void rearrange(vector<T>& a, vector<int>& p) {
    vector<T> b = a;
    for (int i = 0; i < int(a.size()); i++) {
        a[i] = b[p[i]];
    }
    return;
}

}  // namespace useful
using namespace useful;

bool r(i64 a, i64 b, i64 c, i64 d) { return a <= b && b <= c && c <= d; }

void solve() {
    int a, b, c, d;
    in(a, b, c, d);
    if (a > b) {
        swap(a, b);
        swap(c, d);
    }
    if (r(a, b, c, d)) {
        print(d - b + c - a);
    } else if (r(a, b, d, c)) {
        print(1 + d + c - a);
    } else if (r(a, c, b, d)) {
        print(c - a + d - b);
    } else if (r(a, d, b, c)) {
        print(c - a + 1 + d);
    } else if (r(a, c, d, b)) {
        print(1 + d + 1 + c + max(0, 2 - a));
    } else if (r(a, d, c, b)) {
        print(c - a + 1 + d);
    } else if (r(c, a, b, d)) {
        print(d - b + 1 + c);
    } else if (r(d, a, b, c)) {
        print(c - a + 1 + d);
    } else if (r(c, a, d, b)) {
        print(1 + d + 1 + c);
    } else if (r(d, a, c, b)) {
        print(1 + d + c - a);
    } else if (r(c, d, a, b)) {
        print(1 + d + 1 + c);
    } else if (r(d, c, a, b)) {
        print(1 + c + 1 + d);
    } else {
        assert(0);
    }
}

int main() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    int t;
    cin >> t;
    while (t--) solve();
}