#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define ALL(x) (x).begin(), (x).end()
#ifdef LOCAL
#include "debug.hpp"
#else
#define debug(...) void(0)
#endif

template <typename T> istream& operator>>(istream& is, vector<T>& v) {
    for (T& x : v) is >> x;
    return is;
}
template <typename T> ostream& operator<<(ostream& os, const vector<T>& v) {
    for (size_t i = 0; i < v.size(); i++) {
        os << v[i] << (i + 1 == v.size() ? "" : " ");
    }
    return os;
}

template <typename T> T gcd(T x, T y) { return y != 0 ? gcd(y, x % y) : x; }
template <typename T> T lcm(T x, T y) { return x / gcd(x, y) * y; }

int topbit(signed t) { return t == 0 ? -1 : 31 - __builtin_clz(t); }
int topbit(long long t) { return t == 0 ? -1 : 63 - __builtin_clzll(t); }
int botbit(signed a) { return a == 0 ? 32 : __builtin_ctz(a); }
int botbit(long long a) { return a == 0 ? 64 : __builtin_ctzll(a); }
int popcount(signed t) { return __builtin_popcount(t); }
int popcount(long long t) { return __builtin_popcountll(t); }
bool ispow2(int i) { return i && (i & -i) == i; }
long long MSK(int n) { return (1LL << n) - 1; }

template <class T> T ceil(T x, T y) {
    assert(y >= 1);
    return (x > 0 ? (x + y - 1) / y : x / y);
}
template <class T> T floor(T x, T y) {
    assert(y >= 1);
    return (x > 0 ? x / y : (x - y + 1) / y);
}

template <class T1, class T2> inline bool chmin(T1& a, T2 b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}
template <class T1, class T2> inline bool chmax(T1& a, T2 b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}

template <typename T> void mkuni(vector<T>& v) {
    sort(v.begin(), v.end());
    v.erase(unique(v.begin(), v.end()), v.end());
}
template <typename T> int lwb(const vector<T>& v, const T& x) { return lower_bound(v.begin(), v.end(), x) - v.begin(); }

const int INF = (1 << 30) - 1;
const long long IINF = (1LL << 60) - 1;
const int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
const int MOD = 998244353;
// const int MOD = 1000000007;

void solve() {
    int A, B, C, D;
    cin >> A >> B >> C >> D;

    vector<int> cand;
    for (int val : {0, A, B, C, D}) {
        if (val - 1 >= 0) cand.emplace_back(val - 1);
        cand.emplace_back(val);
        cand.emplace_back(val + 1);
    }
    auto x = cand, y = cand;
    mkuni(x);
    mkuni(y);
    int n = x.size(), m = y.size();
    vector<vector<ll>> G(n * m, vector<ll>(n * m, IINF));
    for (int i = 0; i < n * m; i++) G[i][i] = 0;
    for (int i = 0; i < n * m; i++) {
        for (int j = 0; j < n * m; j++) {
            if (i == j) continue;
            int ax = x[i / m], ay = y[i % m];
            int bx = x[j / m], by = y[j % m];
            if (ax != bx and ay != by) continue;
            if (ay != by) {
                swap(ax, ay);
                swap(bx, by);
            }
            if (bx == 0 and by != 0) {
                G[i][j] = 1;
                continue;
            }
            if (ax == ay or bx == ay) continue;
            if (ax <= ay and ay <= bx) continue;
            if (bx < ax) continue;
            G[i][j] = bx - ax;
        }
    }

    for (int k = 0; k < n * m; k++) {
        for (int i = 0; i < n * m; i++) {
            for (int j = 0; j < n * m; j++) {
                chmin(G[i][j], G[i][k] + G[k][j]);
            }
        }
    }

    int sx = lwb(x, A), sy = lwb(y, B);
    int tx = lwb(x, C), ty = lwb(y, D);
    ll res = G[sx * m + sy][tx * m + ty];
    cout << res << '\n';
}

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    int T;
    cin >> T;
    for (; T--;) solve();
    return 0;
}