from collections import deque, defaultdict, Counter
from bisect import bisect_left, bisect_right, insort
from itertools import permutations, combinations, groupby
from heapq import heappop, heappush
import math, sys
input = lambda: sys.stdin.readline().rstrip("\r\n")
def printl(li, sep=" "): print(sep.join(map(str, li)))
def yn(flag): print(Yes if flag else No)
_int = lambda x: int(x)-1
MOD = 998244353 #10**9+7
INF = 1<<60
Yes, No = "Yes", "No"

def left(i, j):
    k = 2**j
    return i//k

for _ in range(int(input())):
    sx, sy, tx, ty = map(int, input().split())
    if sx > tx: sx, sy, tx, ty = tx, ty, sx, sy
    ans = abs(sy-ty)
    sy, ty = max(sy, ty), max(sy, ty)
    if sy >= 60:
        print(ans)
        continue
    j = sy
    sx = left(sx, j)
    tx = left(tx, j)
    tmp = INF
    for k in range(61):
        res = k*2
        a = left(sx, k)
        b = left(tx, k)
        res += b-a
        tmp = min(tmp, res)
    ans += tmp
    print(ans)