#include<bits/stdc++.h>
using namespace std;
namespace my_std{
	#define ll long long
	#define bl bool
	ll my_pow(ll a,ll b,ll mod){
		ll res=1;
		if(!b) return 1;
		while(b){
			if(b&1) res=(res*a)%mod;
			a=(a*a)%mod;
			b>>=1;
		}
		return res;
	}
	ll qpow(ll a,ll b){
		ll res=1;
		if(!b) return 1;
		while(b){
			if(b&1) res*=a;
			a*=a;
			b>>=1;
		}
		return res;
	}
	#define db double
	#define pf printf
	#define pc putchar
	#define fr(i,x,y) for(register ll i=(x);i<=(y);i++)
	#define pfr(i,x,y) for(register ll i=(x);i>=(y);i--)
	#define go(u) for(ll i=head[u];i;i=e[i].nxt)
	#define enter pc('\n')
	#define space pc(' ')
	#define fir first
	#define sec second
	#define MP make_pair
	#define il inline
	#define inf 8e18
	#define random(x) rand()*rand()%(x)
	#define inv(a,mod) my_pow((a),(mod-2),(mod))
	il ll read(){
		ll sum=0,f=1;
		char ch=0;
		while(!isdigit(ch)){
			if(ch=='-') f=-1;
			ch=getchar();
		}
		while(isdigit(ch)){
			sum=sum*10+(ch^48);
			ch=getchar();
		}
		return sum*f;
	}
	il void write(ll x){
		if(x<0){
			x=-x;
			pc('-');
		}
		if(x>9) write(x/10);
		pc(x%10+'0');
	}
	il void writeln(ll x){
		write(x);
		enter;
	}
	il void writesp(ll x){
		write(x);
		space;
	}
}
using namespace my_std;
#define ull __int128
#define LC x<<1
#define RC x<<1|1
vector<ll> ins[400040],del[400040];
ll n,lshx[400040],cntx=0,lshy[400040],cnty=0,cnt[200020];
ull ans=0;
struct node{
	ll l,r,d,u;
}a[200020];
struct Node{
	ll x,y,opt,id;
}p[400040];
il bl operator<(const Node &x,const Node &y){
	if(x.x==y.x) return x.opt>y.opt;
	return x.x<y.x;
}
struct BIT{
	ll N,tree[400040];
	il void clr(){
		fr(i,1,N) tree[i]=0;
	}
	il ll lowbit(ll x){
		return x&(-x);
	}
	il void mdf(ll x,ll v){
		while(x<=N){
			tree[x]+=v;
			x+=lowbit(x);
		}
	}
	il ll query(ll x){
		ll res=0;
		while(x){
			res+=tree[x];
			x-=lowbit(x);
		}
		return res;
	}
}T;
struct seg{
	ll len,sum1,sum2,lz;
	ull sum3;
	il void upd(ull v){
		ull tmp1=sum1,tmp2=sum2,tmp3=sum3;
		sum1=tmp1+v*len;
		sum2=tmp2+2*v*tmp1+len*v*v;
		sum3=tmp3+3*v*tmp2+3*v*v*tmp1+len*v*v*v;
		lz+=v;
	}
}tree[1600016];
il seg operator+(const seg &x,const seg &y){
	return (seg){x.len+y.len,x.sum1+y.sum1,x.sum2+y.sum2,0,x.sum3+y.sum3};
}
il void pushdown(ll x){
	if(!tree[x].lz) return;
	tree[LC].upd(tree[x].lz);
	tree[RC].upd(tree[x].lz);
	tree[x].lz=0;
}
void build(ll x,ll l,ll r){
	tree[x]=(seg){r-l+1,0,0,0,0};
	if(l==r) return;
	ll mid=(l+r)>>1;
	build(LC,l,mid);
	build(RC,mid+1,r);
}
void mdf(ll x,ll l,ll r,ll ql,ll qr,ll v){
	if(ql<=l&&r<=qr){
		tree[x].upd(v);
		return;
	}
	ll mid=(l+r)>>1;
	pushdown(x);
	if(ql<=mid) mdf(LC,l,mid,ql,qr,v);
	if(mid<qr) mdf(RC,mid+1,r,ql,qr,v);
	tree[x]=tree[LC]+tree[RC];
}
void calc1(){
	T.N=cntx;
	fr(i,1,n) T.mdf(a[i].r,1);
	fr(i,1,n) cnt[i]-=T.query(a[i].l-1);
	T.clr();
	fr(i,1,n) T.mdf(a[i].l,1);
	fr(i,1,n) cnt[i]-=T.query(cntx)-T.query(a[i].r);
	T.clr();
	T.N=cnty;
	fr(i,1,n) T.mdf(a[i].u,1);
	fr(i,1,n) cnt[i]-=T.query(a[i].d-1);
	T.clr();
	fr(i,1,n) T.mdf(a[i].d,1);
	fr(i,1,n) cnt[i]-=T.query(cnty)-T.query(a[i].u);
	T.clr();
}
void calc(){
	sort(p+1,p+2*n+1);
	T.N=cnty;
	fr(i,1,2*n){
		if(!p[i].opt) T.mdf(p[i].y,1);
		else cnt[p[i].id]+=T.query(p[i].y-1);
	}
	T.clr();
}
void calc2(){
	fr(i,1,n) p[i]=(Node){a[i].r,cnty-a[i].d+1,0,0};
	fr(i,1,n) p[n+i]=(Node){a[i].l,cnty-a[i].u+1,1,i};
	calc();
	fr(i,1,n) p[i]=(Node){cntx-a[i].l+1,cnty-a[i].d+1,0,0};
	fr(i,1,n) p[n+i]=(Node){cntx-a[i].r+1,cnty-a[i].u+1,1,i};
	calc();
	fr(i,1,n) p[i]=(Node){a[i].r,a[i].u,0,0};
	fr(i,1,n) p[n+i]=(Node){a[i].l,a[i].d,1,i};
	calc();
	fr(i,1,n) p[i]=(Node){cntx-a[i].l+1,a[i].u,0,0};
	fr(i,1,n) p[n+i]=(Node){cntx-a[i].r+1,a[i].d,1,i};
	calc();
}
void solve(ll o){
	fr(i,1,n){
		if(a[i].l>a[i].r||a[i].d>a[i].u) continue;
		ins[a[i].l].push_back(i);
		del[a[i].r].push_back(i);
	}
	build(1,1,cnty);
	fr(i,1,cntx){
		fr(j,0,(ll)ins[i].size()-1) mdf(1,1,cnty,a[ins[i][j]].d,a[ins[i][j]].u,1);
		ans-=(ull)o*(tree[1].sum3-3*tree[1].sum2+2*tree[1].sum1)/6;
		fr(j,0,(ll)del[i].size()-1) mdf(1,1,cnty,a[del[i][j]].d,a[del[i][j]].u,-1);
	}
	fr(i,1,cntx){
		ins[i].clear();
		del[i].clear();
	}
}
int main(){
	n=read();
	fr(i,1,n){
		lshx[++cntx]=a[i].l=read();
		lshx[++cntx]=a[i].r=read();
		lshy[++cnty]=a[i].d=read();
		lshy[++cnty]=a[i].u=read();
		cnt[i]=n-1;
	}
	sort(lshx+1,lshx+cntx+1);
	cntx=unique(lshx+1,lshx+cntx+1)-lshx-1;
	sort(lshy+1,lshy+cnty+1);
	cnty=unique(lshy+1,lshy+cnty+1)-lshy-1;
	fr(i,1,n){
		a[i].l=lower_bound(lshx+1,lshx+cntx+1,a[i].l)-lshx;
		a[i].r=lower_bound(lshx+1,lshx+cntx+1,a[i].r)-lshx;
		a[i].d=lower_bound(lshy+1,lshy+cnty+1,a[i].d)-lshy;
		a[i].u=lower_bound(lshy+1,lshy+cnty+1,a[i].u)-lshy;
	}
	calc1();
	calc2();
	ans=n*(n-1)*(n-2)/6;
	ll tmp=0;
	fr(i,1,n) tmp+=cnt[i];
	ans-=(n-2)*tmp/2;
	fr(i,1,n) ans+=cnt[i]*(cnt[i]-1)/2;
	solve(1);
	fr(i,1,n) a[i].r--;
	solve(-1);
	fr(i,1,n) a[i].d++;
	solve(1);
	fr(i,1,n) a[i].r++;
	solve(-1);
	write(ans);
}
/*
6
4 5 6 9
3 7 5 8
6 10 1 6
2 3 4 9
7 9 7 9
2 5 6 8
ans:
5
*/