#include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<utility>
#include<cassert>
#include<complex>
#include<numeric>
using namespace std;

//#define int long long
typedef long long ll;

typedef unsigned long long ul;
typedef unsigned int ui;
const ll mod = 1000000007;
const ll INF = mod * mod;
typedef pair<int, int>P;
#define stop char nyaa;cin>>nyaa;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
#define all(v) (v).begin(),(v).end()
typedef pair<ll, ll> LP;
typedef long double ld;
typedef pair<ld, ld> LDP;
const ld eps = 1e-12;
const ld pi = acos(-1.0);
//typedef vector<vector<ll>> mat;
typedef vector<int> vec;

ll mod_pow(ll a, ll n, ll m) {
	ll res = 1;
	while (n) {
		if (n & 1)res = res * a%m;
		a = a * a%m; n >>= 1;
	}
	return res;
}

struct modint {
	ll n;
	modint() :n(0) { ; }
	modint(ll m) :n(m) {
		if (n >= mod)n %= mod;
		else if (n < 0)n = (n%mod + mod) % mod;
	}
	operator int() { return n; }
};
bool operator==(modint a, modint b) { return a.n == b.n; }
modint operator+=(modint &a, modint b) { a.n += b.n; if (a.n >= mod)a.n -= mod; return a; }
modint operator-=(modint &a, modint b) { a.n -= b.n; if (a.n < 0)a.n += mod; return a; }
modint operator*=(modint &a, modint b) { a.n = ((ll)a.n*b.n) % mod; return a; }
modint operator+(modint a, modint b) { return a += b; }
modint operator-(modint a, modint b) { return a -= b; }
modint operator*(modint a, modint b) { return a *= b; }
modint operator^(modint a, int n) {
	if (n == 0)return modint(1);
	modint res = (a*a) ^ (n / 2);
	if (n % 2)res = res * a;
	return res;
}

ll inv(ll a, ll p) {
	return (a == 1 ? 1 : (1 - p * inv(p%a, a)) / a + p);
}
modint operator/(modint a, modint b) { return a * modint(inv(b, mod)); }

const int max_n = 1 << 18;
modint fact[max_n], factinv[max_n];
void init_f() {
	fact[0] = modint(1);
	for (int i = 0; i < max_n - 1; i++) {
		fact[i + 1] = fact[i] * modint(i + 1);
	}
	factinv[max_n - 1] = modint(1) / fact[max_n - 1];
	for (int i = max_n - 2; i >= 0; i--) {
		factinv[i] = factinv[i + 1] * modint(i + 1);
	}
}
modint comb(int a, int b) {
	if (a < 0 || b < 0 || a < b)return 0;
	return fact[a] * factinv[b] * factinv[a - b];
}
using mP = pair<modint, modint>;

ll t3[31];
void solve() {
	t3[0] = 1;
	rep(i, 30) {
		t3[i + 1] = t3[i] * 3;
	}
		ll x[2], y[2];
		cin >> x[0] >> y[0] >> x[1] >> y[1];
		rep(i, 2) {
			x[i]--; y[i]--;
		}

		if (x[0] > x[1]) {
			swap(x[0], x[1]);
			swap(y[0], y[1]);
		}
		ll ans = abs(x[1] - x[0]) + abs(y[1] - y[0]);
		for (int t = 29; t >= 0; t--) {
			ll dx = x[0] / t3[t+1];
			ll gdx = x[1] / t3[t + 1];
			ll dy = y[0] / t3[t + 1];
			ll gdy = y[1] / t3[t + 1];
			
			if (dx == gdx) {
				ll rx = x[0] % t3[t + 1];
				ll grx = x[1] % t3[t + 1];
				if (t3[t] <= rx && rx < 2 * t3[t] && t3[t] <= grx && grx < 2 * t3[t]) {
					bool prob = true;
					if (dy == gdy) {
						ll ry = y[0] % t3[t + 1];
						ll gry = y[1] % t3[t + 1];
						prob = false;
						if (ry < t3[t] && gry >= 2 * t3[t])prob = true;
						if (gry < t3[t] && ry >= 2 * t3[t])prob = true;
					}
					else {
						ll yy = abs(y[1] - y[0]);
						if (yy < 2 * t3[t])prob = false;
					}
					if (prob) {
						ll ori = abs(x[1] - x[0]);
						ll nexu = rx - t3[t] + 1 + grx - t3[t] + 1;
						ll nexd = 2 * t3[t] - rx + 2 * t3[t] - grx;
						ll ad = min(nexu, nexd) - ori;
						//cout << "izyou x " << t << endl;
						cout << ans + ad << endl; return;
					}
				}
			}
			if (dy == gdy) {
				ll ry = y[0] % t3[t + 1];
				ll gry = y[1] % t3[t + 1];
				if (t3[t] <= ry && ry < 2 * t3[t] && t3[t] <= gry && gry < 2 * t3[t]) {
					bool prob = true;
					if (dx == gdx) {
						ll rx = x[0] % t3[t + 1];
						ll grx = x[1] % t3[t + 1];
						prob = false;
						if (rx < t3[t] && grx >= 2 * t3[t])prob = true;
						if (grx < t3[t] && rx >= 2 * t3[t])prob = true;
					}
					else {
						ll xx = abs(x[1] - x[0]);
						if (xx < 2 * t3[t])prob = false;
					}
					if (prob) {
						ll ori = abs(y[1] - y[0]);
						ll nexu = ry - t3[t] + 1 + gry - t3[t] + 1;
						ll nexd = 2 * t3[t] - ry + 2 * t3[t] - gry;
						ll ad = min(nexu, nexd) - ori;
						//cout << "izyou y " << t << endl;
						cout << ans + ad << endl; return;
					}
				}
			}
		}
		//cout << "hutuu" << endl;
		cout << ans << endl;
}


signed main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	//cout << fixed << setprecision(7);
	//init_f();
	//init();
	int t; cin >> t; rep(i, t)solve();
	//solve();
	stop
		return 0;
}
