#include<bits/stdc++.h>
#define Yukinoshita namespace
#define Yukino std
using Yukinoshita Yukino;
int read()
{
	int s=0,w=1;
	char ch=getchar();
	while(ch<'0'||ch>'9') w=ch=='-'?-1:1,ch=getchar();
	while(ch>='0'&&ch<='9') s=s*10+ch-'0',ch=getchar();
	return s*w;
}
using ll=long long;
const int mxn=1e6+5;
int l[mxn],r[mxn],u[mxn],d[mxn];
int deg[mxn];
int N;
struct BIT
{
	#define lowbit(x) (x&-x)
	int t[mxn];
	void add(int x,int v)
	{
		for(;x<=N;x+=lowbit(x))
			t[x]+=v;
	}
	int ask(int x)
	{
		int s=0;	
		for(;x;x-=lowbit(x))
			s+=t[x];
		return s;
	}
}T1,T2;
int ask(int l,int r)
{
	return T2.ask(r)-T1.ask(l);
}
void add(int l,int r,int v)
{
	T1.add(r,v),T2.add(l,v);
}
int p[mxn];
ll C(int n,int m)
{
	ll mul=1,i;
	for(i=n-m+1;i<=n;i++)
		mul*=i;
	for(i=1;i<=m;i++)
		mul/=i;
	return mul;
}
struct segmeng_tree
{
	struct seg
	{
		int l,r,tag;
		ll s[3];
	}t[mxn*4];
	#define ls w<<1
	#define rs ls|1
	void build(int w,int l,int r)
	{
		t[w].l=l,t[w].r=r;
		if(l<r)
		{
			int mid=l+r>>1;
			build(ls,l,mid);
			build(rs,mid+1,r);
		}
		t[w].s[0]=r-l+1;
	}
	void pushup(int w)
	{
		for(int i=0;i<3;i++)
			t[w].s[i]=t[ls].s[i]+t[rs].s[i];
	}
	void ad(int w,int v)
	{
		t[w].tag+=v;
		for(int i=2;~i;i--)
		{
			ll s=0;
			for(int j=0;j<=i;j++)
				s+=t[w].s[j]*C(v,i-j);
			t[w].s[i]=s;
		}
	}
	void pushdown(int w)
	{
		if(t[w].tag)
			ad(ls,t[w].tag),ad(rs,t[w].tag),t[w].tag=0;
	}
	ll ask(int w,int l,int r)
	{
		if(t[w].l>=l&&t[w].r<=r) return t[w].s[2];
		pushdown(w);
		ll s=0;
		if(t[ls].r>=l) s=ask(ls,l,r);
		if(t[rs].l<=r) s+=ask(rs,l,r);
		return s;
	}
	void add(int w,int l,int r,int v)
	{
		if(t[w].l>=l&&t[w].r<=r)
		{
			ad(w,v);
			return;
		}
		pushdown(w);
		if(t[ls].r>=l) add(ls,l,r,v);
		if(t[rs].l<=r) add(rs,l,r,v);
		pushup(w);
	}
}t1,t2;
int main()
{
	vector<int> h1,h2;
	int n=read(),i,j,x;
	N=n*2;
	for(i=1;i<=n;i++)
		l[i]=read(),r[i]=read(),u[i]=read(),d[i]=read(),
		h1.push_back(l[i]),h1.push_back(r[i]),
		h2.push_back(u[i]),h2.push_back(d[i]);
	sort(h1.begin(),h1.end());
	sort(h2.begin(),h2.end());
	for(i=1;i<=n;i++)
		l[i]=lower_bound(h1.begin(),h1.end(),l[i])-h1.begin()+1,
		r[i]=lower_bound(h1.begin(),h1.end(),r[i])-h1.begin()+1,
		u[i]=lower_bound(h2.begin(),h2.end(),u[i])-h2.begin()+1,
		d[i]=lower_bound(h2.begin(),h2.end(),d[i])-h2.begin()+1;
	for(i=1;i<=n;i++)
		p[l[i]]=i,p[r[i]]=-i;
	for(i=1;i<=N;i++)
		if(x=p[i])
		{
			if(x>0)
				deg[x]+=ask(u[x],d[x]);
			add(u[abs(x)],d[abs(x)],x>0?1:-1);
		}
	for(i=1;i<=N;i++)
		if(x=p[i])
		{
			if(x>0)
				add(u[abs(x)],d[abs(x)],x>0?1:-1);	
			deg[abs(x)]-=ask(u[abs(x)],d[abs(x)])*(x>0?1:-1);
		}
	ll s1=0,s2=0;
	for(i=1;i<=n;i++)
		s1+=deg[i],s2+=1ll*deg[i]*(deg[i]-1)/2;
	ll ans=n*(n-1ll)*(n-2)/6-s1*(n-2ll)/2+s2;
	t1.build(1,1,N),t2.build(1,1,N);
	for(i=1;i<=N;i++)
		if(x=p[i])
		{
			if(x>0)
				ans-=t1.ask(1,u[x],d[x])-t2.ask(1,u[x],d[x]-1);
			t1.add(1,u[abs(x)],d[abs(x)],x>0?1:-1);
			t2.add(1,u[abs(x)],d[abs(x)]-1,x>0?1:-1);
		}
	cout<<ans;
}