#include <bits/stdc++.h> 
#define cs const
#define pb push_back
using namespace std;
#define fi first
#define se second 
cs int oo = 1e9; 
typedef long long ll; 
typedef pair <int, int> pi;

int T, ans; 
int px[8] = {1, 2, 2, 1, -1, -2, -2, -1};
int py[8] = {2, 1, -1, -2, -2, -1, 1, 2}; 
cs int B = 100; 
int d[B + B + 5][B + B + 5];

int work(int x, int y) {
    x = abs(x), y = abs(y);
    if(x <= B && y <= B) return d[x + B][y + B];
    if(x > y) swap(x, y);
    int s = min(x, y - x); 
    if(s == x) {
        y -= 2 * s, x -= s; 
        if(y > B) y -= (y - B + 4) / 4 * 4; 
        return d[x + B][y + B] + s; 
    }
    int l = 0, r = s; 
    while(l < r) {
        int mid = (l + r) >> 1; 
        int x_ = x - mid, y_ = y - 2 * mid; 
        if(x_ <= B && y_ <= B) r = mid; 
        else l = mid + 1; 
    }
    x -= l, y -= l * 2; 
    if(x > B) {
        int s = (x - B + 3) / 3; 
        x -= s * 3, y -= s * 3; 
        l += s * 2; 
    }
    return d[x + B][y + B] + l; 
}

void ck(int Y, int x, int y, int s) {
    // cout << "Ck " << Y << ' ' << x <<  ' ' << y << ' ' << s << endl; 
    if(x != 0) {
        if(y <= Y) {
            ans = min(ans, s + 3);
        }
        else {
            ans = min(ans, s + 2);
        }
    }
    else {
        if(y <= Y) {
            if(y < 0) { 
                ans = min(ans, s + 4); 
            }
            else {
                if(s > 0) {
                    ans = min(ans, s + 2);
                }
                else {
                    // 4 or 2 
                    if(Y - y == 1 && y > 1) {
                        ans = min(ans, s + 3);
                    }
                    if(Y - y == 2 && Y > 4) {
                        ans = min(ans, s + 3);
                    }
                    if(Y - y == 3 && Y > 4) {
                        
                        ans = min(ans, s + 3);
                    }
                    ans = min(ans, s + 4); 
                }
            }
        }
        else {
            ans = min(ans, s + 1); 
        }
    }
}

int main() {
    #ifdef FSYo
    freopen("1.in","r",stdin);
    #endif
    cin >> T; 

    memset(d, -1, sizeof(d));
    d[B][B] = 0; 
    queue <pi> q; 
    q.push(pi(B, B));
    while(!q.empty()) {
        pi x = q.front(); q.pop();
        for(int e = 0; e < 8; e++) {
            int ux = x.fi + px[e], uy = x.se + py[e];
            if(ux >= 0 && uy >= 0 && ux <= B * 2 && uy <= B * 2) {
                if(d[ux][uy] == -1) 
                    q.push(pi(ux, uy)), d[ux][uy] = d[x.fi][x.se] + 1; 
            }
        }
    }
    /*
    for(int i = 95; i <= 105; i++, puts(""))
    for(int j = 95; j <= 105; j++) cout << d[i][j] << ' ';
    */
    while(T--) {
        int xh, yh, xc, yc; 
        scanf("%d%d%d%d", &xh, &yh, &xc, &yc);

        static int f[8]; 
        for(int i = 0; i < 8; i++) 
            f[i] = work(xh - px[i], yh - py[i]); 
        /*  
        int px[8] = {1, 2, 2, 1, -1, -2, -2, -1};
        int py[8] = {2, 1, -1, -2, -2, -1, 1, 2}; 
        */
        if(xc == 1 && yc == 1) {
            f[0] ++, f[1] ++; 
        }
        if(xc == 1 && yc == -1) {
            f[2] ++, f[3] ++; 
        }
        if(xc == -1 && yc == -1) {
            f[4] ++, f[5] ++; 
        }
        if(xc == -1 && yc == 1) {
            f[6] ++, f[7] ++; 
        }

        ans = oo; 
        for(int i = 0; i < 8; i++)
            ans = min(ans, f[i] + 1);
        // cout << ans << ' ' << xh << ' ' << yh << endl; 

        if(xh < 0 && yh < 0) {
            xh = -xh, yh = -yh, xc = -xc, yc = -yc; 
        }
        if(xh < 0 && yh > 0) {
            swap(xh, yh); yh = -yh; 
            swap(xc, yc); yc = -yc; 
        }
        if(xh > 0 && yh < 0) {
            swap(xh, yh); xh = -xh; 
            swap(xc, yc); xc = -xc; 
        }
        
        // cout << ans << ' ' << xh << ' ' << yh << endl; 
        

        int s = (xh + 1) / 2, dy = s + 2 * (xh & 1);
        // [-dy, dy] 
        int U = yh - dy, D = yh + dy; 

        // cout << U << ' ' << D << endl; 

        if(U < 0) {
            U = -U; 
            if(U & 1) D = max(-D, 1); 
            else D = max(-D, 2);
            ck(D, xc, - yc, s); 
        } 
        if(D > 0) {
            if(D & 1) U = max(U, 1);
            else U = max(U, 2);
            ck(U, xc, yc, s); 
        }
        
        for(int i = 1; i <= 10; i++) 
        ck(i, xc, yc, work(xh, yh - i)),
        ck(i, xc, - yc, work(xh, yh + i)); 

        swap(xh, yh); swap(xc, yc); 

        s = (xh + 1) / 2, dy = s + 2 * (xh & 1);
        // [-dy, dy] 
        U = yh - dy, D = yh + dy; 

        // cout << U << ' ' << D << endl; 

        if(U < 0) {
            U = -U; 
            if(U & 1) D = max(-D, 1); 
            else D = max(-D, 2);
            ck(D, xc, - yc, s); 
        } 
        if(D > 0) {
            if(D & 1) U = max(U, 1);
            else U = max(U, 2);
            ck(U, xc, yc, s); 
        }

        for(int i = 1; i <= 10; i++) 
        ck(i, xc, yc, work(xh, yh - i)),
        ck(i, xc, - yc, work(xh, yh + i)); 

        cout << ans << '\n';

    }
    return 0; 
}