//QOJ #1838. Intellectual Implementation
#include<bits/extc++.h>
#include<bits/stdc++.h>
//#pragma GCC optimize(2)
//This code contains niche emotional elements. It is recommended to watch it after the age of 18.
#ifdef __unix__
#define getchar getchar_unlocked
#define putchar putchar_unlocked
#else
#define getchar _getchar_nolock
#define putchar _putchar_nolock
#endif
#define debug(x) fprintf(stderr,"Line %d,%s=%lld\n",__LINE__,#x,(ll)x)
#define debugline fprintf(stderr,"--------------------------\n")
#define all(x) x.begin(),x.end()
#define Inf (int)INFINITY
#define pii pair<ll,ll>
#define inf 0x3f3f3f3f
#define pb push_back
#define ll long long
#define endl '\n'
#define y second
#define x first
using namespace std;
const int N=2e5+10;
void read(){};
template<class T1,class...T2>
inline void read(T1&ret,T2&...rest){
	ret=0;char c=getchar();bool f=false;
	while(c<'0'||c>'9')f=c=='-',c=getchar();
	while(c>='0'&&c<='9')ret=ret*10+c-'0',c=getchar();
	f&&(ret=-ret),read(rest...);
}
#define cin(...) read(__VA_ARGS__)
template<class T>
inline void print(T x){
	static int s[35],t=0;
	bool f=x<0;if(f)x=-x;
	do s[t++]=x%10,x/=10;while(x);
	f&&putchar('-');while(t)putchar(s[--t]+'0');
}
ll ct3,res,tmp;
int n,m0,m1,t,d[N],lsx[N*2],lsy[N*2];
struct J{int l,r,u,d;}a[N];
struct L{int l,r,y,i;}Li[N*2];
struct SegmentTree{
#define mid ((a[x].l+a[x].r)>>1)
#define rc (x*2+1)
#define lc (x*2)
	struct Node{int l,r;ll s1,s2,lz;}a[N*16];
	void upd(int x,ll v){
		a[x].lz+=v,a[x].s2+=v*(2*a[x].s1+(a[x].r-a[x].l+1)*v),a[x].s1+=(a[x].r-a[x].l+1)*v;
	}
	void pushup(int x){
		a[x].s1=a[lc].s1+a[rc].s1,
		a[x].s2=a[lc].s2+a[rc].s2;
	}
	void pushdown(int x){
		if(a[x].lz)
			upd(lc,a[x].lz),upd(rc,a[x].lz),a[x].lz=0;
	}
	void build(int l,int r,int x=1){
		a[x]={l,r,0,0,0};
		if(l^r)build(l,mid,lc),build(mid+1,r,rc);
	}
	void modify(int l,int r,int v,int x=1){
		if(l<=a[x].l&&a[x].r<=r)
			return upd(x,v);
		pushdown(x);
		if(l<=mid)modify(l,r,v,lc);
		if(mid<r)modify(l,r,v,rc);
		pushup(x);
	}
	pii merge(pii a,pii b){return{a.x+b.x,a.y+b.y};}
	pii query(int l,int r,int x=1){
		if(l<=a[x].l&&a[x].r<=r)
			return{a[x].s1,a[x].s2};
		pushdown(x);
		if(r<=mid)return query(l,r,lc);
		if(mid<l)return query(l,r,rc);
		return merge(query(l,r,lc),query(l,r,rc));
	}
}tr;
struct Fenwick{
	int t[N*2];inline int lowbit(const int&x){return x&(-x);}
	void add(int x,int v){for(int i=x;i<=n*2;i+=lowbit(i))t[i]+=v;}
	int query(int l,int r){
		l--;int res=0;
		for(;r>l;r-=lowbit(r))res+=t[r];
		for(;l>r;l-=lowbit(l))res-=t[l];
		return res;
	}
}t0,t1,t2,t3;
int main(){
	cin(n),tr.build(1,n*4);
	for(int i=1;i<=n;i++)
		cin(a[i].l,a[i].r,a[i].u,a[i].d),
		lsx[i]=a[i].l,lsx[i+n]=a[i].r,
		lsy[i]=a[i].d,lsy[i+n]=a[i].u;
	sort(lsx+1,lsx+n*2+1),sort(lsy+1,lsy+n*2+1),
	m0=unique(lsx+1,lsx+n*2+1)-lsx-1,
	m1=unique(lsy+1,lsy+n*2+1)-lsy-1;
	for(int i=1;i<=n;i++)
		a[i].l=lower_bound(lsx+1,lsx+m0+1,a[i].l)-lsx,
		a[i].r=lower_bound(lsx+1,lsx+m0+1,a[i].r)-lsx,
		a[i].u=lower_bound(lsy+1,lsy+m1+1,a[i].u)-lsy,
		a[i].d=lower_bound(lsy+1,lsy+m1+1,a[i].d)-lsy,
		Li[++t]={a[i].l,a[i].r,a[i].d,-i},Li[++t]={a[i].l,a[i].r,a[i].u,i};
	sort(Li+1,Li+t+1,[](L a,L b){return a.y>b.y;});
	for(int i=1,tu=0,td=0;i<=t;i++){
		auto[l,r,y,ix]=Li[i];
		if(ix<0){
			d[-ix]-=tu-t3.query(1,l)-t2.query(r,n*2);
			pii ret=tr.query(l*2,r*2);
			ct3+=(ret.y-ret.x)/2;
			t0.add(l,1),t1.add(r,1);
			td++,tr.modify(l*2,r*2,1);
		}
		else{
			d[ix]+=td-t1.query(1,l)-t0.query(r,n*2)-1;
			t2.add(l,1),t3.add(r,1);
			tu++,tr.modify(l*2,r*2,-1);
		}
	}
	debug(ct3);
	tr.build(1,n*4);
	for(int i=1;i<=t;i++){
		auto[l,r,y,ix]=Li[i];
		if(ix<0){
			pii ret=tr.query(l*2,r*2-1);
			ct3-=(ret.y-ret.x)/2;
			tr.modify(l*2,r*2-1,1);
		}
		else
			tr.modify(l*2,r*2-1,-1);
	}
	res=n*1ll*(n-1)*(n-2)/6-ct3;
	debug(ct3);
	for(int i=1;i<=n;i++)
//		debug(d[i]),
		tmp+=d[i]*1ll*(n-1-d[i]);
	print(res-=tmp/2),putchar(endl);
	return 0;
}