#include<bits/stdc++.h>
using namespace std;
int X0[200005],X1[200005];
int Y0[200005],Y1[200005];
int X2[200005],Y2[200005];
int Y3[200005],S[200005];
int SX0[200005],SY0[200005];
int SX1[200005],SY1[200005];
struct apple{
	int x,y,wz;
	apple(int x=0,int y=0,int wz=0):x(x),y(y),wz(wz){}
}e[800005];
inline int suan(int A,int B,int x,int y){
	int r=min(x-A,y-B);
	if(r<0)return 0;
	if((B+y)%2==0)return r/2+1;
	return (r+1)/2;
}
struct pear{
	int k,A[200005],B[200005],q[200005];
	void init(){
		
	}
	long long query(int x,int y){
		if(!k)return 0;
		int t=suan(A[1],B[1],x,y);
		if(!t)return 0;
		int L=1,R=k;
		while(L<=R){
			int mid=(L+R)>>1;
			if(suan(A[mid],B[mid],x,y)==0)R=mid-1;
			else L=mid+1;
		}
		int a=L-1;
		if(!a)return 0;
		L=2,R=a;
		while(L<=R){
			int mid=(L+R)>>1;
			if(suan(A[mid],B[mid],x,y)<suan(A[mid-1],B[mid-1],x,y)){
				R=mid-1;
			}else L=mid+1;
		}
		long long ans=0;
		for(int i=1;i<=R;++i)ans+=t*q[i];
		for(int i=R+1;i<=a;++i){
			ans+=(t-i+R)*q[i];
		}
		return 0;
	}
}a23,a24,a33,a43;
vector<long long>mosaic(vector<int>X,vector<int>Y,vector<int>T,vector<int>B,vector<int>L,vector<int>R){
	int n=X.size(),m=T.size();
	for(int i=0;i<n;++i){
		X0[i]=X[i];Y0[i]=Y[i];
	}
	X1[0]=Y0[1];Y1[0]=X0[1];
	for(int i=1;i<n;++i){
		if(X1[i-1]==0&&X0[i]==0)X1[i]=1;
		else X1[i]=0;
	}
	for(int i=1;i<n;++i){
		if(Y1[i-1]==0&&Y0[i]==0)Y1[i]=1;
		else Y1[i]=0;
	}
	X2[1]=Y1[2];Y2[1]=X1[2];
	for(int i=2;i<n;++i){
		if(X2[i-1]==0&&X1[i]==0)X2[i]=1;
		else X2[i]=0;
	}
	for(int i=2;i<n;++i){
		if(Y2[i-1]==0&&Y1[i]==0)Y2[i]=1;
		else Y2[i]=0;
	}
	Y3[2]=X2[3];
	for(int i=3;i<n;++i){
		if(Y3[i-1]==0&&Y2[i]==0)Y3[i]=1;
		else Y3[i]=0;
	}
	for(int i=2;i<n;++i){
		if(Y2[i-1]==0&&Y1[i]==0)Y2[i]=1;
		else Y2[i]=0;
	}
	SX0[0]=X0[0];
	for(int i=1;i<n;++i)SX0[i]=SX0[i-1]+X0[i];
	SY0[0]=Y0[0];
	for(int i=1;i<n;++i)SY0[i]=SY0[i-1]+Y0[i];
	SX1[0]=X1[0];
	for(int i=1;i<n;++i)SX1[i]=SX1[i-1]+X1[i];
	SY1[0]=Y1[0];
	for(int i=1;i<n;++i)SY1[i]=SY1[i-1]+Y1[i];
	vector<long long>ans(m,0);
	int tt=0;
	for(int i=0;i<m;++i){
		int l=T[i],r=B[i];
		int ll=L[i],rr=R[i];
		if(l==0){
			ans[i]+=SX0[rr]-(ll==0?0:SX0[ll-1]);
			++l;
		}
		if(l>r)continue;
		if(l==1){
			ans[i]+=SX1[rr]-(ll==0?0:SX1[ll-1]);
			++l;
		}
		if(l>r)continue;
		if(ll==0){
			ans[i]+=SY0[r]-SY0[l-1];
			++ll;
		}
		if(ll>rr)continue;
		if(ll==1){
			ans[i]+=SY1[r]-SY1[l-1];
			++ll;
		}
		if(ll>rr)continue;
		e[++tt]=apple(r,rr,i+1);
		if(ll>2)e[++tt]=apple(r,ll-1,-i-1);
		if(l>2)e[++tt]=apple(l-1,rr,-i-1);
		if(l>2&&ll>2)e[++tt]=apple(l-1,ll-1,i+1);
	}
	S[1]=0;
	for(int i=2;i<n;++i)S[i]=S[i-1]+Y2[i];
	for(int i=1;i<=tt;++i){
		int x=e[i].x,y=e[i].y;
		long long z=1ll*S[x]*(y/2)+1ll*(x-1-S[x])*((y-1)/2);
		if(e[i].wz>0)ans[e[i].wz-1]+=z;
		else ans[-e[i].wz-1]-=z;
	}
	a23.k=a24.k=a33.k=a43.k=0;
	for(int i=3;i<n;i+=2){
		int k=++a23.k;
		a23.A[k]=2,a23.B[k]=i;
		if(X2[i-1]==0&&X2[i]==0)a23.q[k]=1;
		else a23.q[k]=0;
	}
	for(int i=4;i<n;i+=2){
		int k=++a24.k;
		a24.A[k]=2,a24.B[k]=i;
		if(X2[i-1]==0&&X2[i]==0)a24.q[k]=1;
		else a24.q[k]=0;
	}
	a23.init();a24.init();
	for(int j=1;j<=tt;++j){
		int x=e[j].x,y=e[j].y;
		long long z=a23.query(x,y)+a24.query(x,y);
		if(e[j].wz>0)ans[e[j].wz-1]-=z;
		else ans[-e[j].wz-1]+=z;
	}
	for(int i=3;i<n;i+=2){
		int k=++a33.k;
		a33.A[k]=i,a33.B[k]=3;
		if(Y2[i]==0&&Y3[i]==0)a33.q[k]=1;
		else a33.q[k]=0;
	}
	for(int i=4;i<n;i+=2){
		int k=++a43.k;
		a43.A[k]=i,a43.B[k]=3;
		if(Y2[i]==0&&Y3[i]==0)a43.q[k]=1;
		else a43.q[k]=0;
	}
	a33.init();a43.init();
	for(int j=1;j<=tt;++j){
		int x=e[j].x,y=e[j].y;
		long long z=a33.query(x,y)+a43.query(x,y);
		if(e[j].wz>0)ans[e[j].wz-1]-=z;
		else ans[-e[j].wz-1]+=z;
	}
	return ans;
}
#ifndef ONLINE_JUDGE
int main(){
	int n=7;mt19937 mt(1377);
	vector<int>X={0,0,0,1,0,0,0},Y={0,1,1,1,1,1,0};
	vector<int>T,B,L,R;
	int Q=30;
	while(Q--){
		int l=mt()%n,r=mt()%n,ll=mt()%n,rr=mt()%n;
		if(l>r)swap(l,r);
		if(ll>rr)swap(ll,rr);
		T.emplace_back(l);B.emplace_back(r);
		L.emplace_back(ll);R.emplace_back(rr);
	}
	auto ans=mosaic(X,Y, T,B,L,R);
	for(auto cu:ans)printf("%lld\n",cu);
	return 0;
}
#endif