#ifndef __MATH_UTIL_H__
#define __MATH_UTIL_H__

#include <cstdint>
#include <cassert>

int64_t strictMod(int64_t a, int64_t b);
int64_t strictDiv(int64_t a, int64_t b);

template <class T>
T power(T base, uint64_t exp);

/* 累乗; 置く場所がないのでここに置いておきます O(logN) */
template <class T>
T power(T base, uint64_t exp) {
	T product = T(1);
	while (exp > 0) {
		if (exp & 1) {
			product *= base;
		}
		base *= base;
		exp >>= 1;
	}
	return product;
}

#endif

#define _CRT_SECURE_NO_WARNINGS
#define _SCL_SECURE_NO_WARNINGS
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cassert>
#include <iostream>
#include <string>
#include <vector>
#include <list>
#include <utility>
#include <algorithm>
#include <functional>
#include <cmath>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <iomanip>
#include <sstream>
#include <bitset>
#include <limits>
#include <numeric>
#include <valarray>
#include <fstream>
#include <array>
#include <random>
#include <unordered_set>
#include <unordered_map>

using namespace std;
using uint = uint32_t;
using LL = int64_t;
using ULL = uint64_t;
using PP = pair<LL, LL>;
template <typename T> using PriorityQ = priority_queue<T, vector<T>, greater<T> >;
#define REP(i, a, n) for(LL i = (a), i##_max_ = (n); i < i##_max_; ++i)
#define REM(i, a, n) for(LL i = (LL)(n) - 1, i##_min_ = (a); i >= i##_min_; --i)
#define FLOAT fixed << setprecision(16)
#define SPEEDUP { cin.tie(NULL); ios::sync_with_stdio(false); }
const int INF = 0x3FFFFFFF;
const LL INFLL = 0x3FFFFFFF3FFFFFFF;
const double INFD = 1.0e+308;
const double EPS = 1.0e-9;

void YesNo(bool b) { cout << (b ? "Yes" : "No") << endl; }
void YESNO(bool b) { cout << (b ? "YES" : "NO") << endl; }
template <class T, class U> istream& operator>>(istream& ist, pair<T, U>& right) { return ist >> right.first >> right.second; }
template <class T, class U> ostream& operator<<(ostream& ost, const pair<T, U>& right) { return ost << right.first << ' ' << right.second; }
template <class T, class TCompatible, size_t N> void Fill(T(&dest)[N], const TCompatible& val) { fill(dest, dest + N, val); }
template <class T, class TCompatible, size_t M, size_t N> void Fill(T(&dest)[M][N], const TCompatible& val) { for (int i = 0; i < M; ++i) Fill(dest[i], val); }
template <class T> T Next() { T buf; cin >> buf; return buf; }
istream& Ignore(istream& ist) { string s; ist >> s; return ist; }
bool Inside(int i, int j, int h, int w) { return i >= 0 && i < h && j >= 0 && j < w; }

#ifdef ONLY_MY_ENVIR
#include "IntMod.h"
#include "Accumulator.h"
#include "Algebraic.h"
#include "BinaryMatrix.h"
#include "BinaryTree.h"
#include "Bipartite.h"
#include "BIT.h"
#include "Compressor.h"
#include "Decompositions.h"
#include "DynamicMod.h"
#include "Factorization.h"
#include "FFT.h"
#include "FlowSolver.h"
#include "Graph.h"
#include "GraphUtil.h"
#include "LazySegmentTree.h"
#include "LIS.h"
#include "Math.h"
#include "MathUtil.h"
#include "Matrix.h"
#include "MinCostFlowSolver.h"
#include "MinMax.h"
#include "Numbers.h"
#include "Optimize.h"
#include "Permutation.h"
#include "Polynomial.h"
#include "Position.h"
#include "Range.h"
#include "Rational.h"
#include "SegmentTree.h"
#include "SegmentTree2D.h"
#include "Sets.h"
#include "Shortest.h"
#include "SlidingWindow.h"
#include "SpanningTree.h"
#include "StringSearching.h"
#include "SuffixArray.h"
#include "Tree.h"
#include "UnionFind.h"
#include "VectorUtil.h"
#endif

#ifdef __GNUC__
typedef __int128 LLL;
istream& operator>>(istream& ist, __int128& val) { LL tmp; ist >> tmp; val = tmp; return ist; }
ostream& operator<<(ostream& ost, __int128 val) { LL tmp = val; ost << tmp; return ost; }
#endif

using Num = vector<int>;
Num conv(LL n) {
	Num ret;
	REP(z, 0, 30) {
		ret.push_back(n % 3);
		n /= 3;
	}
	return ret;
}

LL dec(const Num& n) {
	LL sum = 0;
	LL base = 1;
	REP(z, 0, 30) {
		sum += base * n[z];
		base *= 3;
	}
	return sum;
}

LL force(Num n, int k) {
	LL p = dec(n);

	n[k] = 0;
	REP(i, 0, k) n[i] = 2;
	LL a = dec(n);

	n[k] = 2;
	REP(i, 0, k) n[i] = 0;
	LL b = dec(n);
	return min(abs(p - a), abs(p - b));
}

LL cat(const Num& a, const Num& b, const Num& c, const Num& d) {
	REM(k, 0, 30) {
		if (a[k] != c[k]) return 0;
		if (a[k] == 1 && c[k] == 1) {
			Num dd = d;
			REP(i, 0, k) dd[i] = 0;
			Num bb = b;
			REP(i, 0, k) bb[i] = 0;
			LL diff = abs(dec(dd) - dec(bb));
			if (diff >= 2 * power(3LL, k)) {
				return min(force(a, k), force(c, k));
			}
		} 
	}
	return 0;
}

LL sub(LL a, LL b, LL c, LL d) {
	return abs(c - a) + abs(d - b)
		+ 2 * max(
			cat(conv(a), conv(b), conv(c), conv(d)),
			cat(conv(b), conv(a), conv(d), conv(c))
		);
}

int main() {
	int Q;
	cin >> Q;
	REP(i, 0, Q) {
		LL a, b, c, d;
		cin >> a >> b >> c >> d;
		--a; --b; --c; --d;
		cout << sub(a, b, c, d) << endl;
	}
	return 0;
}



Measured memory_bytes: 384