import std.conv, std.functional, std.range, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.bitmanip, std.complex, std.container, std.math, std.mathspecial, std.numeric, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }

bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }

int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }
int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }
int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }


enum INF = 10L^^18;

long solve(long A, long B, long C, long D) {
  if (A < B) {
    swap(A, B);
    swap(C, D);
  }
  long ans = INF;
  void check(long d, long x, long y) {
    if (x <= C && y <= D) {
      chmin(ans, d + (C - x) + (D - y));
    }
  }
  if (C > D) {
    check(0, A, B);
    check((B == 0) ? 5 : (B == 1) ? 4 : 3, 1, 0);
  } else {
    if (B >= 1) {
      check(1, 0, B);
    }
    check((B == 0) ? ((A == 1) ? 3 : 2) : (B == 1) ? 1 : 3, 0, 1);
  }
  return ans;
}

void main() {
  try {
    for (; ; ) {
      const numCases = readInt;
      foreach (caseId; 0 .. numCases) {
        const A = readLong;
        const B = readLong;
        const C = readLong;
        const D = readLong;
        
        const ans = solve(A, B, C, D);
        writeln(ans);
      }
    }
  } catch (EOFException e) {
  }
}