#pragma GCC optimize(2)
#pragma GCC optimize(2)
#pragma GCC optimize(2)
#pragma GCC optimize(3)
#pragma GCC optimize("Ofast")
#include<bits/stdc++.h>
#define file(x) freopen(x".in","r",stdin),freopen(x".out","w",stdout)
#define ll long long
using namespace std;
const int N=4e5+10;
int n,l[N],r[N],d[N],u[N];
ll sum[N],res3;
struct node{
	int l,r,v;
};
vector<node> g[N],q[N];
ll C2(ll v){return v*(v-1)/2;}
ll C3(ll v){return v*(v-1)*(v-2)/6;}
#define Clr(a) memset(a,0,sizeof(a))
struct Seg{
	int tg[N<<2];
	ll s1[N<<2],s2[N<<2],s3[N<<2];
	#define ls (o<<1)
	#define rs (o<<1|1)
	void clr(){
		Clr(tg),Clr(s1),Clr(s2),Clr(s3);
	}
	void add_tag(int o,int l,int r,int v){
		tg[o]+=v;
		s3[o]=s3[o]+s2[o]*v+s1[o]*C2(v)+C3(v)*(r-l+1);
		s2[o]=s2[o]+s1[o]*v+C2(v)*(r-l+1);
		s1[o]=s1[o]+1ll*v*(r-l+1);
	}
	void down(int o,int l,int r){
		if(tg[o]){
			int mid=l+r>>1;
			add_tag(ls,l,mid,tg[o]),add_tag(rs,mid+1,r,tg[o]);
			tg[o]=0;
		}
	}
	void up(int o){
		s1[o]=s1[ls]+s1[rs],s2[o]=s2[ls]+s2[rs],s3[o]=s3[ls]+s3[rs];
	}
	void update(int o,int l,int r,int x,int y,int v){
		if(x<=l&&r<=y)return add_tag(o,l,r,v);
		int mid=l+r>>1;down(o,l,r);
		if(x<=mid)update(ls,l,mid,x,y,v);
		if(y>mid)update(rs,mid+1,r,x,y,v);
		up(o);
	}
}T1;
struct Bit{
	ll c1[N],c2[N];
	void clr(){memset(c1,0,sizeof(c1));memset(c2,0,sizeof(c2));}
	void add(int i,ll v1){ll v2=v1*i;for(;i<=2*n;i+=i&-i)c1[i]+=v1,c2[i]+=v2;}
	ll sum(int i){ll s=0,t=i+1;for(;i;i&=i-1)s+=c1[i]*t-c2[i];return s;}
	void Add(int l,int r,ll v){add(l,v),add(r+1,-v);}
	ll Sum(int l,int r){return sum(r)-sum(l-1);}
}T2,T3;
void work(int k1,int k2,int val){
	for(int i=0;i<=2*n;i++)g[i].clear(),q[i].clear();
	for(int i=1;i<=n;i++)r[i]+=k1,u[i]+=k2;
	for(int i=1;i<=n;i++)if(d[i]<=u[i])g[l[i]].push_back({d[i],u[i],1}),g[r[i]+1].push_back({d[i],u[i],-1});
	for(int i=1;i<=n;i++)if(d[i]<=u[i])q[l[i]-1].push_back({d[i],u[i],-i}),q[r[i]].push_back({d[i],u[i],i});
	T1.clr(),T2.clr(),T3.clr();
	for(int i=1;i<=2*n;i++){
		for(node t:g[i])T2.Add(t.l,t.r,t.v),T3.Add(t.l,t.r,-1ll*(i-1)*t.v),T1.update(1,1,2*n,t.l,t.r,t.v);
		res3+=val*T1.s3[1];
		for(node t:q[i])
			if(t.v>0)sum[t.v]+=(T2.Sum(t.l,t.r)*i+T3.Sum(t.l,t.r))*val;
			else sum[-t.v]-=(T2.Sum(t.l,t.r)*i+T3.Sum(t.l,t.r))*val;
	}
	for(int i=1;i<=n;i++)r[i]-=k1,u[i]-=k2;
//	printf("Work:%d %d %d\n",k1,k2,val);
//	for(int i=1;i<=n;i++)printf("%lld ",sum[i]);puts("");
}
int tx[N],ty[N];
signed main(){
//	freopen("gift.in","r",stdin);
//	file("gift");
	scanf("%d",&n);
	for(int i=1;i<=n;i++)scanf("%d%d%d%d",&l[i],&r[i],&d[i],&u[i]),tx[i]=l[i],tx[i+n]=r[i],ty[i]=d[i],ty[i+n]=u[i];
	sort(tx+1,tx+2*n+1),sort(ty+1,ty+2*n+1);
	for(int i=1;i<=n;i++){
		l[i]=lower_bound(tx+1,tx+2*n+1,l[i])-tx;
		r[i]=lower_bound(tx+1,tx+2*n+1,r[i])-tx-1;
		d[i]=lower_bound(ty+1,ty+2*n+1,d[i])-ty;
		u[i]=lower_bound(ty+1,ty+2*n+1,u[i])-ty-1;
	}
	work(0,0,1),work(-1,0,-1),work(0,-1,-1),work(-1,-1,1);
	ll ans=C3(n),res1=0,res2=0;
	for(int i=1;i<=n;i++)--sum[i];
//	for(int i=1;i<=n;i++)printf("%lld ",sum[i]);puts("");
	for(int i=1;i<=n;i++)res1+=sum[i],res2+=1ll*sum[i]*(sum[i]-1)/2;
//	printf("%lld %lld %lld %lld\n",ans,res1,res2,res3);
	res1=res1*(n-2)/2;
	ans=ans-res1+res2-res3;
	printf("%lld\n",ans);
}