# include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ll;
struct Rec{int x1,x2,y1,y2;}a[200010];
ll du[200010],ans3;
int n,yy[400010],C[4][4];
struct Event
{
	int x,y1,y2,id,add;
	int tim(){return x-(!id);}
	Event(int _x=0,int _y1=0,int _y2=0,int _i=0,int _a=0):x(_x),y1(_y1),y2(_y2),id(_i),add(_a){}
	bool operator<(const Event &a)const
	{
		if(x!=a.x) return x<a.x;
		return id<a.id;
	}
}b[800010];
struct Matrix
{
	ll a1,a2,a3;
	Matrix(ll _a1=0,ll _a2=0,ll _a3=0):a1(_a1),a2(_a2),a3(_a3){}
	Matrix operator*(const Matrix &m)const{return Matrix(a1+m.a1,a2+m.a2,a2*m.a1+a3+m.a3);}
}tag[1100010];
ll len[1100010],sum[1100010],hsum[1100010],S[1100010][4];
void pushup(int rt)
{
	sum[rt]=sum[rt*2]+sum[rt*2+1];
	hsum[rt]=hsum[rt*2]+hsum[rt*2+1];
	for(int i=1;i<=3;i++) S[rt][i]=S[rt*2][i]+S[rt*2+1][i];
}
void push(int rt,Matrix t)
{
	hsum[rt]+=t.a2*sum[rt]+t.a3*len[rt];sum[rt]+=t.a1*len[rt];
	tag[rt]=t*tag[rt];
	for(int i=3;i>=1;i--)
	{
		ll pw=t.a1;
		for(int j=1;j<=i;pw*=t.a1,j++) S[rt][i]+=C[i][j]*pw*S[rt][i-j];
	}
}
void pushdown(int rt)
{
	if(!tag[rt].a1 && !tag[rt].a2 && !tag[rt].a3) return;
	push(rt*2,tag[rt]);push(rt*2+1,tag[rt]);
	tag[rt]=0;
}
void build(int rt,int l,int r)
{
	sum[rt]=hsum[rt]=0;tag[rt]=0;
	S[rt][0]=S[rt][1]=S[rt][2]=S[rt][3]=0;
	if(l==r) return S[rt][0]=len[rt]=yy[l+1]-yy[l],void();
	int mid=(l+r)/2;
	build(rt*2,l,mid);build(rt*2+1,mid+1,r);
	S[rt][0]=len[rt]=len[rt*2]+len[rt*2+1];
}
void update(int rt,int l,int r,int x,int y,const Matrix &z)
{
	if(l>y || r<x) return;
	if(x<=l && r<=y) return push(rt,z);
	pushdown(rt);
	int mid=(l+r)/2;
	update(rt*2,l,mid,x,y,z);update(rt*2+1,mid+1,r,x,y,z);
	pushup(rt);
}
ll query(int rt,int l,int r,int x,int y)
{
	if(l>y || r<x) return 0;
	if(x<=l && r<=y) return hsum[rt];
	pushdown(rt);
	int mid=(l+r)/2;
	return query(rt*2,l,mid,x,y)+query(rt*2+1,mid+1,r,x,y);
}
void work(int k)
{
	int tot=0,len=0;
	for(int i=1;i<=n;i++) yy[++len]=a[i].y1,yy[++len]=a[i].y2+1;
	sort(yy+1,yy+len+1);
	len=unique(yy+1,yy+len+1)-yy-1;
	auto get=[&](int y){return lower_bound(yy+1,yy+len+1,y)-yy;};
	build(1,1,len-1);
	for(int i=1;i<=n;i++)
	{
		int y1=get(a[i].y1),y2=get(a[i].y2+1)-1;
		b[++tot]=Event(a[i].x1-1,y1,y2,i,-1);
		b[++tot]=Event(a[i].x2,y1,y2,i,1);
		b[++tot]=Event(a[i].x1,y1,y2,0,1);
		b[++tot]=Event(a[i].x2+1,y1,y2,0,-1);
	}
	sort(b+1,b+tot+1);
	for(int i=1;i<=tot;i++)
	{
		if(b[i].id) du[b[i].id]+=k*b[i].add*query(1,1,len-1,b[i].y1,b[i].y2);
		else update(1,1,len-1,b[i].y1,b[i].y2,b[i].add);
		if(i<tot && b[i].tim()<b[i+1].tim())
		{
			push(1,Matrix(0,b[i+1].tim()-b[i].tim()));
			ll C3=(S[1][3]-3*S[1][2]+2*S[1][1])*12297829382473034411ull/2;
			ans3+=k*C3*(b[i+1].tim()-b[i].tim());
		}
	}
}
int main()
{
	for(int i=0;i<=3;i++) C[i][0]=1;
	for(int i=1;i<=3;i++)
		for(int j=1;j<=i;j++)
			C[i][j]=C[i-1][j]+C[i-1][j-1];
	cin>>n;
	for(int i=1;i<=n;i++) scanf("%d%d%d%d",&a[i].x1,&a[i].x2,&a[i].y1,&a[i].y2);
	work(1);
	for(int i=1;i<=n;i++) a[i].x1++;
	work(-1);
	for(int i=1;i<=n;i++) a[i].y1++;
	work(1);
	for(int i=1;i<=n;i++) a[i].x1--;
	work(-1);
	ll ans=(ll)n*(n-1)*(n-2)/6-ans3,m=0;
	for(int i=1;i<=n;i++) du[i]--,m+=du[i],ans+=du[i]*(du[i]-1)/2;
	m/=2;ans-=m*(n-2);
	cout<<(ans&((1ull<<63)-1))<<endl;
	return 0;
}