/**
 *    author:  otera    
**/
#include<iostream>
#include<string>
#include<cstdio>
#include<cstring>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<deque>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<complex>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<utility>
#include<cassert>
using namespace std;

#define int long long
typedef long long ll;
typedef unsigned long long ul;
typedef unsigned int ui;
typedef long double ld;
const int inf=1e9+7;
const ll INF=1LL<<60 ;
const ll mod=1e9+7 ;
#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++)
typedef complex<ld> Point;
const ld eps = 1e-8;
const ld pi = acos(-1.0);
typedef pair<int, int> P;
typedef pair<ld, ld> LDP;
typedef pair<ll, ll> LP;
#define fr first
#define sc second
#define all(c) c.begin(),c.end()
#define pb push_back
#define debug(x)  cerr << #x << " = " << (x) << endl;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }

bool between(int x, int y1, int y2) {
	if(y1 > y2) swap(y1, y2);
	if(x % 3 == 1) {
		 if(y2 - y1 >= 2) return true;
	}
	return false;
}

int extra(int x1, int y1, int x2, int y2) {
	int res = 0;
	int three = 1;
	rep(i, 32) {
		if(x1 / three == x2 / three and between(x1 / three, y1 / three, y2 / three)) {
			int tmp = min(min(x1 % three, x2 % three) + 1, min(three - x1 % three, three - x2 % three));
			chmax(res, tmp);
		}
		three *= 3;
	}
	return res;
}

int dist(int x1, int y1, int x2, int y2) {
	return abs(x1 - x2) + abs(y1 - y2) + 2 * max(extra(x1, y1, x2, y2), extra(y1, x1, y2, x2));
}

void solve() {
	int q; cin >> q;
	rep(i, q) {
		int a, b, c, d; cin >> a >> b >> c >> d;
		-- a, -- b, -- c, -- d;
		cout << dist(a, b, c, d) << endl;
	}
}

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