#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
//using mint = modint998244353;
//const int mod = 998244353;
//const int INF = 1e9;
//const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n-1); i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r-1);i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define endl "\n"
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }

int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int t; cin >> t;
	while (t--) {
		int a, b, c, d; cin >> a >> b >> c >> d;
		if (a > b) {
			swap(a, b);
			swap(c, d);
		}
		long long ans;
		if ((a <= c) && (b <= d) && (c < d)) {
			ans = c - a + d - b;
		}
		else if ((a <= c) && (b <= d) && (c > d)) {
			ans = 1 + c - a + d;
		}
		else if ((a > c) && (b > d)) {
			ans = 2 + c + d;
		}
		else if ((a <= c) && (b > d) && (c < d)) {
			if (1 == a)ans = 3 + c + d;
			else ans = 2 + c + d;
		}
		else if ((a <= c) && (b > d) && (c > d)) {
			ans = c - a + 1 + d;
		}
		else if ((a > c) && (b <= d) && (c < d)) {
			ans = 1 + c + d - b;
		}
		else {
			ans = 2 + c + d;
		}
		cout << ans << endl;
	}
	return 0;
}