using System.Diagnostics;
class Program
{
    static string ReadLine() => Console.ReadLine().Trim();
    static int ReadInt() => int.Parse(ReadLine());
    static long ReadLong() => long.Parse(ReadLine());
    static int[] ReadIntArray() { string str = ReadLine(); return str != "" ? str.Split().Select(_ => int.Parse(_)).ToArray() : new int[0]; }
    static long[] ReadLongArray() { string str = ReadLine(); return str != "" ? str.Split().Select(_ => long.Parse(_)).ToArray() : new long[0]; }
    static (int, int) ReadInt2() { int[] vs = ReadIntArray(); return (vs[0], vs[1]); }
    static (int, int, int) ReadInt3() { int[] vs = ReadIntArray(); return (vs[0], vs[1], vs[2]); }
    static (int, int, int, int) ReadInt4() { int[] vs = ReadIntArray(); return (vs[0], vs[1], vs[2], vs[3]); }
    static (int, int, int, int, int) ReadInt5() { int[] vs = ReadIntArray(); return (vs[0], vs[1], vs[2], vs[3], vs[4]); }
    static (long, long) ReadLong2() { long[] vs = ReadLongArray(); return (vs[0], vs[1]); }
    static (long, long, long) ReadLong3() { long[] vs = ReadLongArray(); return (vs[0], vs[1], vs[2]); }
    static (long, long, long, long) ReadLong4() { long[] vs = ReadLongArray(); return (vs[0], vs[1], vs[2], vs[3]); }

    static void Main()
    {
        SourceExpander.Expander.Expand();

        int T = ReadInt();

        for (int i = 0; i < T; i++)
        {
            (long sx, long sy, long tx, long ty) = ReadLong4();

            long dy = Math.Abs(ty - sy);
            long max_y = Math.Max(sy, ty);

            long left = Math.Min(sx, tx);
            long right = Math.Max(sx, tx);

            long dx = 0;

            if (max_y <= 60)
                dx = (right / (1L << (int)max_y)) - (left / (1L << (int)max_y));
            else
                dx = 0;

            Console.WriteLine(dx + dy);
            //Console.WriteLine(Math.Abs(dx) + dy);
        }
    }

    void F11()
    {
        (int N, int K) = ReadInt2();
        long[] A = ReadLongArray();

        long[] dp = new long[K + 1];

        for (int i = 0; i < N; i++)
        {
            long v = A[i];

            long[] n_dp = (long[])dp.Clone();
            for (int j = 0; j <= K; j++)
            {
                if (j + 1 <= K && n_dp[j + 1] < dp[j] + v)
                    n_dp[j + 1] = dp[j] + v;
                if (n_dp[j] < dp[j])
                    n_dp[j] = dp[j];
            }
            dp = n_dp;
        }
        //Console.WriteLine(dp.Max());
    }
}
#region Expanded by https://github.com/kzrnm/SourceExpander
namespace SourceExpander{public class Expander{[Conditional("EXP")]public static void Expand(string inputFilePath=null,string outputFilePath=null,bool ignoreAnyError=true){}public static string ExpandString(string inputFilePath=null,bool ignoreAnyError=true){return "";}}}
#endregion Expanded by https://github.com/kzrnm/SourceExpander