// includes
#include <bits/stdc++.h>
using namespace std;

// macros
#define pb emplace_back
#define mk make_pair
#define FOR(i, a, b) for(int i=(a);i<(b);++i)
#define rep(i, n) FOR(i, 0, n)
#define rrep(i, n) for(int i=((int)(n)-1);i>=0;i--)
#define irep(itr, st) for(auto itr = (st).begin(); itr != (st).end(); ++itr)
#define irrep(itr, st) for(auto itr = (st).rbegin(); itr != (st).rend(); ++itr)
#define whole(x) (x).begin(),(x).end()
#define sz(x) ((int)(x).size())
#define bit(n) (1LL<<(n))
// functions
template <typename T> void unique(T& c){c.erase(std::unique(c.begin(), c.end()), c.end());}
template <class T>bool chmax(T &a, const T &b){if(a < b){a = b; return 1;} return 0;}
template <class T>bool chmin(T &a, const T &b){if(a > b){a = b; return 1;} return 0;}
template <typename T> istream &operator>>(istream &is, vector<T> &vec){for(auto &v: vec)is >> v; return is;}
template <typename T> ostream &operator<<(ostream &os, const vector<T>& vec){for(int i = 0; i < vec.size(); i++){ os << vec[i]; if(i + 1 != vec.size())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const set<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const unordered_set<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const multiset<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const unordered_multiset<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &p){os << "(" << p.first << ", " << p.second << ")"; return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const map<T1, T2> &mp){for(auto itr = mp.begin(); itr != mp.end(); ++itr){ os << "(" << itr->first << ", " << itr->second << ")"; auto titr = itr; if(++titr != mp.end())os << " "; } return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const unordered_map<T1, T2> &mp){for(auto itr = mp.begin(); itr != mp.end(); ++itr){ os << "(" << itr->first << ", " << itr->second << ")"; auto titr = itr; if(++titr != mp.end())os << " "; } return os;}
//  types
using ll = long long int;
using P = pair<int, int>;
// constants
const int inf = 1e9;
const ll linf = 1LL << 50;
const double EPS = 1e-10;
const int mod = 1000000007;
const int dx[4] = {-1, 0, 1, 0};
const int dy[4] = {0, -1, 0, 1};
// io
struct fast_io{
  fast_io(){ios_base::sync_with_stdio(false); cin.tie(nullptr); cout << fixed << setprecision(20);}
} fast_io_;

ll th[33];

int main(int argc, char const* argv[])
{
  int q; cin >> q;
  th[0] = 1;
  FOR(i, 1, 31)th[i] = 3LL * th[i-1];
  rep(i_, q){
    ll a, b, c, d; cin >> a >> b >> c >> d;
    a--; b--; c--; d--;
    ll res = abs(a - c) + abs(b - d);
    for(int k = 30; k >= 1; k--){
      ll ba = a / th[k];
      ll bb = b / th[k];
      ll bc = c / th[k];
      ll bd = d / th[k];
      if(bb == bd){
        if(a > c){
          swap(a, c);
          swap(b, d);
          swap(ba, bc);
          swap(bb, bd);
        }
        if(bb * th[k] + th[k-1] <= b && b < bb * th[k] + 2*th[k-1]){
          if(bb * th[k] + th[k-1] <= d && d < bb * th[k] + 2 * th[k-1]){
            bool ok = false;
            if(a < ba * th[k] + th[k-1] && c >= ba * th[k] + 2 * th[k-1])ok = true;
            if(ba * th[k] + 2 * th[k-1] <= a && c >= (ba + 1) * th[k] + 2 * th[k-1])ok = true;
            if(ok){
              res = linf;
              ll tmp = (b - bb * th[k] - th[k-1] + 1) + (d - bb * th[k] - th[k-1] + 1) + (c - a);
              chmin(res, tmp);
              tmp = (bb * th[k] + 2 * th[k-1] - b) + (bb * th[k] + 2 * th[k-1] - d) + (c - a);
              chmin(res, tmp);
              break;
            }
          }
        }
      }
      if(ba == bc){
        if(b > d){
          swap(a, c);
          swap(b, d);
          swap(ba, bc);
          swap(bb, bd);
        }
        if(ba * th[k] + th[k-1] <= a && a < ba * th[k] + 2 * th[k-1]){
          if(ba * th[k] + th[k-1] <= c && c < ba * th[k] + 2 * th[k-1]){
            bool ok = false;
            if(bb * th[k] + th[k-1] > b && (d >= bb * th[k] + 2 * th[k-1]))ok = true;
            if(bb * th[k] + 2 * th[k-1] <= b && d >= (bb + 1) * th[k] + 2 * th[k-1])ok = true;
            if(ok){
              res = linf;
              ll tmp = (a - ba * th[k] - th[k-1] + 1) + (c - ba * th[k] - th[k-1] + 1) + (d - b);
              chmin(res, tmp);
              tmp = (ba * th[k] + 2 * th[k-1] - a) + (ba * th[k] + 2 * th[k-1] - c) + (d - b);
              chmin(res, tmp);
              break;
            }
          }
        }
      }
    }
    cout << res << endl;
  }
  return 0;
}
