#include<stdio.h>
long long x1,y1,x2,y2,i,j,p,v[100],s;
int n;
int min(long long a, long long b)
{
    if(a<b)return a;
    return b;
}
int main()
{
    freopen("fibo3.in","r",stdin);
    freopen("fibo3.out","w",stdout);
    v[1]=1;
    v[2]=2;
    for(i=3;v[i-1]<=200000000;i++)
        v[i]=v[i-1]+v[i-2];
        scanf("%d",&n);
   for(i=1;i<=n;i++)
    {
        scanf("%lld%lld%lld%lld",&x1,&y1,&x2,&y2);
        p=x2+y2;
        for(j=1;p>=v[j];j++)
        {
            if(v[j]>=x1+y1)
                if(v[j]>x1+y2)
                    s=s+min(v[j]-x1-y1,x2-x1)+1-(v[j]-x1-y2);
                else
                s=s+min(v[j]-x1-y1,x2-x1)+1;
        }
        printf("%lld\n",s);
        s=0;
    }
    return 0;
}