#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
#define lson x<<1
#define rson x<<1|1
using namespace std;
const int maxn=100010;
typedef long long ll;
struct Tag
{ll a,b,c,d;Tag () {a=1,b=c=d=0;}Tag (ll A,ll B,ll C,ll D) {a=A,b=B,c=C,d=D;}Tag operator + (const Tag &x) const {return Tag(a*x.a,b*x.a+x.b,a*x.c+c,d+b*x.c+x.d);}
};
struct node
{ll v,s,l;Tag t;node () {v=s=l=0,t=Tag();}node (ll a,ll b,ll c,Tag d) {v=a,s=b,l=c,t=d;}inline void add(Tag x){s=s+v*x.c+l*x.d,v=v*x.a+l*x.b,t=t+x;}node operator + (const node &a) const{return node(v+a.v,s+a.s,l+a.l,Tag());}
}s[maxn<<2];
int m,n,top;
ll ans[maxn],v[maxn];
int st[maxn],pre[maxn];
struct QUERY
{int x,l,r,org,k;
}q[maxn];
bool cmp(const QUERY &a,const QUERY &b)
{return a.x<b.x;
}
inline void pushdown(int x)
{if(s[x].t.a!=1||s[x].t.b||s[x].t.c||s[x].t.d) s[lson].add(s[x].t),s[rson].add(s[x].t),s[x].t=Tag();
}
void build(int l,int r,int x)
{if(l==r){s[x]=node(),s[x].l=1;return ;}int mid=(l+r)>>1;build(l,mid,lson),build(mid+1,r,rson);s[x]=s[lson]+s[rson];
}
void updata(int l,int r,int x,int a,int b,Tag t)
{if(a>b) return ;if(a<=l&&r<=b){s[x].add(t);return ;}pushdown(x);int mid=(l+r)>>1;if(a<=mid) updata(l,mid,lson,a,b,t);if(b>mid)   updata(mid+1,r,rson,a,b,t);s[x]=s[lson]+s[rson];
}
node query(int l,int r,int x,int a,int b)
{if(a<=l&&r<=b) return s[x];pushdown(x);int mid=(l+r)>>1;if(b<=mid) return query(l,mid,lson,a,b);if(a>mid)   return query(mid+1,r,rson,a,b);return query(l,mid,lson,a,b)+query(mid+1,r,rson,a,b);
}
void work(ll flag)
{int i,j;build(1,n,1);for(j=1;j<=2*m&&!q[j].x;j++);for(i=1;i<=n;i++){updata(1,n,1,pre[i],i,Tag(0,v[i],0,0)),s[1].add(Tag(1,0,1,0));for(;j<=2*m&&q[j].x==i;j++)    ans[q[j].org]+=flag*q[j].k*query(1,n,1,q[j].l,q[j].r).s;}
}
inline int rd()
{int ret=0,f=1;   char gc=getchar();while(gc<'0'||gc>'9')  {if(gc=='-')    f=-f;  gc=getchar();}while(gc>='0'&&gc<='9')  ret=ret*10+gc-'0',gc=getchar();return ret*f;
}
int main()
{m=rd();int i;ll t1=1,t2=1;for(i=1;i<=m;i++)  q[i].l=q[i+m].l=rd(),q[i].r=q[i+m].r=rd(),q[i].x=rd()-1,q[i+m].x=rd(),n=max(n,q[i+m].x),q[i].k=-1,q[i+m].k=1,q[i].org=q[i+m].org=i;for(i=1;i<=n;i++)    t1=t1*1023%1000000000,t2=t2*1025%1000000000,v[i]=t1^t2;sort(q+1,q+2*m+1,cmp);for(i=1;i<=n;i++){while(top&&v[st[top]]>=v[i])    top--;pre[i]=st[top]+1,st[++top]=i;}work(-1);for(top=0,i=1;i<=n;i++){while(top&&v[st[top]]<=v[i])  top--;pre[i]=st[top]+1,st[++top]=i;}work(1);for(i=1;i<=m;i++)   printf("%lld\n",ans[i]);return 0;
}