#include<cstdio>
#include<fstream>
#include<iostream>
#include<algorithm>

using namespace std;

#define nn 100

long long f[nn];
long long n,x,x2,y,y2;
int c;

int main ()
{
f[0]=f[1]=1;
for(int i=2;i<=80;++i)
f[i]=f[i-1]+f[i-2];
ifstream in ("fibo3.in");
freopen("fibo3.out","w",stdout);
in>>n;
while(n){
in>>x>>y>>x2>>y2;
c=0;
for(int i=x;i<=x2;++i)
for(int j=y;j<=y2;++j){
int k=i+j;
c+=binary_search(f+1,f+80,k);
}
printf("%d\n",c);
--n;}
in.close();	
	
return 0;
}