#include<bits/stdc++.h>
#define ll long long
#define y1 yyyyyy
using namespace std;
const int N=1e6+5;
int n,len,p[N],d[N];ll ans,res,s1,s2;
struct node{int x1,x2,y1,y2,id;}a[N],b[N];
bool cmpx1(node x,node y){return x.x1<y.x1;}
bool cmpx2(node x,node y){return x.x2<y.x2;}
bool cmpy1(node x,node y){return x.y1<y.y1;}
bool cmpy2(node x,node y){return x.y2<y.y2;}
struct tree{int sum[2];ll s;}tr[N<<2];
tree operator + (tree x,tree y){return {{x.sum[0]+y.sum[0],x.sum[1]+y.sum[1]},x.s+y.s+1ll*x.sum[1]*y.sum[0]};} 
void update(int o,int l,int r,int x,int y,int v){
	tr[o].sum[y]+=v;
	if(l==r)return ;
	int mid=(l+r)>>1;
	if(x<=mid)update(o<<1,l,mid,x,y,v);
	else update(o<<1|1,mid+1,r,x,y,v);
	tr[o]=tr[o<<1]+tr[o<<1|1];
}	
int query(int o,int l,int r,int x,int y,int z){
	if(x>y)return 0;
	if(x<=l&&r<=y)return tr[o].sum[z];
	int mid=(l+r)>>1,s=0;
	if(x<=mid)s+=query(o<<1,l,mid,x,y,z);
	if(y>mid)s+=query(o<<1|1,mid+1,r,x,y,z);
	return s;
}
tree qry(int o,int l,int r,int x,int y){
	if(x<=l&&r<=y)return tr[o];
	int mid=(l+r)>>1;
	if(y<=mid)return qry(o<<1,l,mid,x,y);
	if(x>mid)return qry(o<<1|1,mid+1,r,x,y);
	return qry(o<<1,l,mid,x,y)+qry(o<<1|1,mid+1,r,x,y);
}
void add(int l,int r,int v){update(1,1,len,l,0,v),update(1,1,len,r,1,v);}
void solve(){
	for(int i=1,j=0;i<=n;i++){
		while(j+1<=n&&b[j+1].x2<a[i].x1)j++,add(b[j].y1,b[j].y2,-1);
		int x=query(1,1,len,1,a[i].y1-1,1)+query(1,1,len,a[i].y2+1,len,0);
		x=i-1-j-x;
		res+=1ll*x*(x-1)/2-qry(1,1,len,a[i].y1,a[i].y2).s;
		add(a[i].y1,a[i].y2,1);
	}
}
struct BIT{int c[N];
void clr(){for(int i=1;i<=len;i++)c[i]=0;}
void add(int x){for(;x<=len;x+=x&-x)c[x]++;}
int qry(int x){int s=0;for(;x;x^=x&-x)s+=c[x];return s;} 
}T1,T2;
void init(){
	sort(a+1,a+n+1,cmpx1),sort(b+1,b+n+1,cmpx2);
	for(int i=1,j=0;i<=n;i++){
		while(j+1<=n&&b[j+1].x2<a[i].x1)j++,d[b[j].id]+=n-i+1,T1.add(b[j].y1),T2.add(b[j].y2);
		d[a[i].id]+=j-T2.qry(a[i].y1-1)-(T1.qry(len)-T1.qry(a[i].y2));
	}
	T1.clr(),T2.clr();
	for(int i=n,j=n+1;i>=1;i--){
		while(j-1>0&&a[j-1].x1>b[i].x2)j--,T1.add(a[j].y1),T2.add(a[j].y2);
		d[b[i].id]+=-T2.qry(b[i].y1-1)-(T1.qry(len)-T1.qry(b[i].y2));
	}
	sort(a+1,a+n+1,cmpy1),sort(b+1,b+n+1,cmpy2);
	for(int i=1,j=0;i<=n;i++){
		while(j+1<=n&&b[j+1].y2<a[i].y1)j++,d[b[j].id]+=n-i+1;
		d[a[i].id]+=j;
	}
}
int main(){
	scanf("%d",&n);
	for(int i=1,x1,x2,y1,y2;i<=n;i++)scanf("%d%d%d%d",&x1,&x2,&y1,&y2),a[i]={x1,x2,y1,y2,i},p[++len]=x1,p[++len]=x2,p[++len]=y1,p[++len]=y2;
	sort(p+1,p+len+1),len=unique(p+1,p+len+1)-(p+1);
	for(int i=1;i<=n;i++){
		a[i].x1=lower_bound(p+1,p+len+1,a[i].x1)-p;
		a[i].x2=lower_bound(p+1,p+len+1,a[i].x2)-p;
		a[i].y1=lower_bound(p+1,p+len+1,a[i].y1)-p;
		a[i].y2=lower_bound(p+1,p+len+1,a[i].y2)-p;
		b[i]=a[i];
	}
	sort(a+1,a+n+1,cmpx1),sort(b+1,b+n+1,cmpx2);
	solve(),init();
	for(int i=1;i<=n;i++)d[i]=n-d[i]-1,s1+=1ll*(n-2)*d[i],s2+=1ll*d[i]*(d[i]-1)/2;
	ans=1ll*n*(n-1)*(n-2)/6-(s1-2*s2)/2-res;
	printf("%lld\n",ans);
	return 0;
}