#include "bits/stdc++.h"
#define rep(i,a,n) for(auto i=a;i<=n;i++)
#define per(i,a,n) for(auto i=n;i>=a;i--)
#define pb push_back
#define mp make_pair
#define FI first
#define SE second
#define all(A) A.begin(),A.end()
#define sz(A) (int)A.size()
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(b<a) {a=b; return 1;} return 0;}
using namespace std;

string to_string(const string& s) {return '"' + s + '"';}
string to_string(const char* s) {return to_string((string) s);}
template<typename A, typename B> string to_string(pair<A, B> p) {return "(" + to_string(p.FI) + ", " + to_string(p.SE) + ")";}
template<typename A> string to_string(A v) 
{
    bool first = 1;
    string res = "{";
    for(const auto &x: v) 
    {
        if (!first) res += ", ";
        first = 0;
        res += to_string(x);
    }
    res += "}";
    return res;
}

void debug_out() {cerr << endl;} 
template<typename Head, typename... Tail> void debug_out(Head H, Tail... T) 
{
    cerr << " " << to_string(H);
    debug_out(T...);
}
#ifndef ONLINE_JUDGE
    #define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#else
    #define debug(...) if(0) puts("No effect.")
#endif

using ll = long long;
//using LL = __int128;
using pii = pair<int,int>;
using vi = vector<int>;
using db = double;
using ldb = long double;

const int maxn = 300;
const int inf = 0x3f3f3f3f;
const int mod = 998244353;

int sg[maxn+5][maxn+5];

int main()
{
    rep(i,1,maxn) rep(j,i+2,maxn)
    {
        vi mark(maxn+1);
        rep(k,1,i-1) mark[sg[k][j]] = 1;
        rep(k,1,j-1) if(abs(i-k)>1) mark[sg[min(i,k)][max(i,k)]] = 1;
        rep(x,0,maxn) if(mark[x]==0) {sg[i][j] = x; break;}
    }
    int cas; scanf("%d",&cas); while(cas--)
    {
        int x1,y1,x2,y2; scanf("%d%d%d%d",&x1,&y1,&x2,&y2);
        if(abs(x1-x2)+abs(y1-y2)<=1) puts("0");
        else if(abs(x1-x2)<=1 && abs(y1-y2)<=1) puts("2");
        else
        {
            int sgx = abs(x1-x2)<=1 ? -1 : sg[min(x1,x2)][max(x1,x2)];
            int sgy = abs(y1-y2)<=1 ? -1 : sg[min(y1,y2)][max(y1,y2)];
            int ans = 0;
            auto solve = [&](int sgy,int i,int j) {
                if(sgy==-1) ans++;
                else 
                {
                    static vi mark; mark.assign(maxn+1,0);
                    rep(k,1,i-1) if(abs(j-k)>1 && sg[k][j]==sgy) ans++;
                    rep(k,1,j-1) if(abs(i-k)>1 && sg[min(i,k)][max(i,k)]==sgy) ans++; 
                }
            };
            solve(sgy,min(x1,x2),max(x1,x2));
            solve(sgx,min(y1,y2),max(y1,y2));
            printf("%d\n",ans);
        }
    }
    return 0;
}