#include<cstdio>
#include<vector>
#include<queue>
#include<cstring>
#include<iostream>
#include<algorithm>
#include<bitset>
#include<ctime>
#include<map>
#include<random>
#include<assert.h>
#define pb emplace_back
#define mp make_pair
#define fi first
#define se second
#define dbg(x) cerr<<"In Line "<< __LINE__<<" the "<<#x<<" = "<<x<<'\n';
#define dpi(x,y) cerr<<"In Line "<<__LINE__<<" the "<<#x<<" = "<<x<<" ; "<<"the "<<#y<<" = "<<y<<'\n';
using namespace std;
typedef double ld;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int>pii;
typedef pair<ll,int>pli;
typedef pair<ll,ll>pll;
typedef pair<ld,ld>pdd;
typedef pair<int,ll>pil;
typedef vector<int>vi;
typedef vector<ll>vll;
typedef vector<pii>vpii;
typedef vector<pil>vpil;
template<typename T>T cmax(T &x, T y){return x=x>y?x:y;}
template<typename T>T cmin(T &x, T y){return x=x<y?x:y;}
template<typename T>
T &read(T &r){
	r=0;bool w=0;char ch=getchar();
	while(ch<'0'||ch>'9')w=ch=='-'?1:0,ch=getchar();
	while(ch>='0'&&ch<='9')r=r*10+(ch^48),ch=getchar();
	return r=w?-r:r;
}
template<typename T1,typename... T2>
void read(T1 &x,T2& ...y){read(x);read(y...);}
const int mod=998244353;
inline void cadd(int &x,int y){x=(x+y>=mod)?(x+y-mod):(x+y);}
inline void cdel(int &x,int y){x=(x-y<0)?(x-y+mod):(x-y);}
inline int add(int x,int y){return (x+y>=mod)?(x+y-mod):(x+y);}
inline int del(int x,int y){return (x-y<0)?(x-y+mod):(x-y);}
int qpow(int x,int y){
	int s=1;
	while(y){
		if(y&1)s=1ll*s*x%mod;
		x=1ll*x*x%mod;
		y>>=1;
	}
	return s;
}
#define bc(x) __builtin_popcount(x)
inline int bit(int x){return 1<<x;}
inline int all(int x){return (1<<x)-1;}
inline int lowbit(int x){return x&(-x);}
// mt19937 rnd(time(NULL)^(ull)(new char));
const int N=400010;
int n;
int deg[N];
struct Node{
	int l,r,d,u,id;
}a[N];
int sx[N<<1],tx,sy[N<<1],ty;
int p[N<<1];
void getdeg1(){
	sort(p+1,p+n+1,[&](const int &x,const int &y){return a[x].r<a[y].r;});
	for(int i=1;i<=n;i++){
		int l=1,r=n,mid,o=0;
		while(l<=r){
			mid=(l+r)>>1;
			if(a[p[mid]].r<a[i].l)o=mid,l=mid+1;
			else r=mid-1;
		}
		deg[a[i].id]-=o;
	}
	sort(p+1,p+n+1,[&](const int &x,const int &y){return a[x].l>a[y].l;});
	for(int i=1;i<=n;i++){
		int l=1,r=n,mid,o=0;
		while(l<=r){
			mid=(l+r)>>1;
			if(a[p[mid]].l>a[i].r)o=mid,l=mid+1;
			else r=mid-1;
		}
		deg[a[i].id]-=o;
	}
	sort(p+1,p+n+1,[&](const int &x,const int &y){return a[x].u<a[y].u;});
	for(int i=1;i<=n;i++){
		int l=1,r=n,mid,o=0;
		while(l<=r){
			mid=(l+r)>>1;
			if(a[p[mid]].u<a[i].d)o=mid,l=mid+1;
			else r=mid-1;
		}
		deg[a[i].id]-=o;
	}
	sort(p+1,p+n+1,[&](const int &x,const int &y){return a[x].d>a[y].d;});
	for(int i=1;i<=n;i++){
		int l=1,r=n,mid,o=0;
		while(l<=r){
			mid=(l+r)>>1;
			if(a[p[mid]].d>a[i].u)o=mid,l=mid+1;
			else r=mid-1;
		}
		deg[a[i].id]-=o;
	}
}
vpii vecld[N<<1],veclu[N<<1],vecrd[N<<1],vecru[N<<1];
struct BIT1{
	int tree[N<<1];
	void modify(int x){for(;x<=2*n;x+=lowbit(x))tree[x]++;}
	int query(int x){int s=0;for(;x;x-=lowbit(x))s+=tree[x];return s;}
	void mem(){for(int i=0;i<=2*n;i++)tree[i]=0;}
}tr1;
struct BIT2{
	int tree[N<<1];
	void modify(int x){for(;x;x-=lowbit(x))tree[x]++;}
	int query(int x){int s=0;for(;x<=2*n;x+=lowbit(x))s+=tree[x];return s;}
	void mem(){for(int i=0;i<=2*n;i++)tree[i]=0;}
}tr2;
void getdeg2(){
	for(int i=1;i<=n;i++){
		vecld[a[i].l].pb(mp(a[i].d,i));
		veclu[a[i].l].pb(mp(a[i].u,i));
		vecrd[a[i].r].pb(mp(a[i].d,i));
		vecru[a[i].r].pb(mp(a[i].u,i));
	}
	tr2.mem();
	for(int i=1;i<=tx;i++){
		for(auto j:veclu[i])
			deg[j.se]+=tr2.query(j.fi+1);
		for(auto j:vecrd[i])
			tr2.modify(j.fi);
	}
	tr1.mem();
	for(int i=1;i<=tx;i++){
		for(auto j:vecld[i])
			deg[j.se]+=tr1.query(j.fi-1);
		for(auto j:vecru[i])
			tr1.modify(j.fi);
	}
	tr2.mem();
	for(int i=tx;i>=1;i--){
		for(auto j:vecru[i])
			deg[j.se]+=tr2.query(j.fi+1);
		for(auto j:vecld[i])
			tr2.modify(j.fi);
	}
	tr1.mem();
	for(int i=tx;i>=1;i--){
		for(auto j:vecrd[i])
			deg[j.se]+=tr1.query(j.fi-1);
		for(auto j:veclu[i])
			tr1.modify(j.fi);
	}
}
vpii vec[N<<1];
#define ls (x<<1)
#define rs ((x<<1)|1)
struct SGT{
	ll s[4];
	int tag;
}tree[N<<3];
void pushup(int x){
	for(int i=0;i<=3;i++)tree[x].s[i]=tree[ls].s[i]+tree[rs].s[i];
}
void upd(int x,int k){
	#define o tree[x].s
	static ll t[4];t[0]=t[1]=t[2]=t[3]=0;
	t[0]=o[0];
	t[1]=o[0]*k+o[1];
	t[2]=o[0]*k*(k-1)/2+o[1]*k+o[2];
	t[3]=o[0]*k*(k-1)/2*(k-2)/3+o[1]*k*(k-1)/2+o[2]*k+o[3];
	for(int i=0;i<=3;i++)o[i]=t[i];
	tree[x].tag+=k;
	#undef o
}
void pushdown(int x){
	if(tree[x].tag){
		int &p=tree[x].tag;
		upd(ls,p);upd(rs,p);
		p=0;
	}
}
void build(int x,int l,int r){
	tree[x].s[0]=r-l+1;tree[x].s[1]=tree[x].s[2]=tree[x].s[3]=tree[x].tag=0;
	if(l==r)return ;
	int mid=(l+r)>>1;
	build(ls,l,mid);build(rs,mid+1,r);
}
void modify(int x,int tl,int tr,int l,int r,int v){
	if(tl>=l&&tr<=r){
		upd(x,v);
		return ;
	}
	int mid=(tl+tr)>>1;pushdown(x);
	if(mid>=l)modify(ls,tl,mid,l,r,v);
	if(mid<r)modify(rs,mid+1,tr,l,r,v);
	pushup(x);
}
#undef ls
#undef rs
ll solve(int dx,int dy){
	for(int i=1;i<=n;i++){
		a[i].r-=dx;
		a[i].d+=dy;
	}
	for(int i=1;i<=tx;i++)vpii().swap(vec[i]);
	for(int i=1;i<=n;i++){
		vec[a[i].l].pb(mp(a[i].d,a[i].u));
		vec[a[i].r+1].pb(mp(-a[i].d,-a[i].u));
	}
	build(1,1,ty);
	ll sum=0;
	for(int i=1;i<=tx;i++){
		for(auto j:vec[i]){
			int l=j.fi,r=j.se;
			if(l>0)modify(1,1,ty,l,r,1);
			else modify(1,1,ty,-l,-r,-1);
		}
		sum+=tree[1].s[3];
	}
	for(int i=1;i<=n;i++){
		a[i].r+=dx;
		a[i].d-=dy;
	}
	return sum;
}
signed main(){
	#ifdef do_while_true
		assert(freopen("ex_land5.in","r",stdin));
//		assert(freopen("land.in","r",stdin));
//		assert(freopen("land.out","w",stdout));
	#endif
	read(n);
	for(int i=1;i<=n;i++)read(a[i].l,a[i].r,a[i].d,a[i].u),a[i].id=p[i]=i;
	for(int i=1;i<=n;i++)sx[2*i-1]=a[i].l,sx[2*i]=a[i].r,sy[2*i-1]=a[i].d,sy[2*i]=a[i].u;
	sort(sx+1,sx+2*n+1);tx=unique(sx+1,sx+2*n+1)-sx-1;
	sort(sy+1,sy+2*n+1);ty=unique(sy+1,sy+2*n+1)-sy-1;
	for(int i=1;i<=n;i++){
		a[i].l=lower_bound(sx+1,sx+tx+1,a[i].l)-sx;
		a[i].r=lower_bound(sx+1,sx+tx+1,a[i].r)-sx;
		a[i].d=lower_bound(sy+1,sy+ty+1,a[i].d)-sy;
		a[i].u=lower_bound(sy+1,sy+ty+1,a[i].u)-sy;
		deg[i]=n-1;
	}
	getdeg1();
	getdeg2();
	ll s0=1ll*n*(n-1)/2*(n-2)/3,s1=0,s2=0;
	for(int i=1;i<=n;i++){
		s1+=1ll*deg[i]*(n-2);
		s2+=1ll*deg[i]*(deg[i]-1)/2;
	}
	s1/=2;
	ll ans=s0-s1+s2;
	ans-=solve(0,0);
	ans+=solve(0,1);
	ans+=solve(1,0);
	ans-=solve(1,1);
	cout << ans << '\n';
    #ifdef do_while_true
		// cerr<<'\n'<<"Time:"<<1.0*clock()/CLOCKS_PER_SEC*1000<<" ms"<<'\n';
	#endif
	return 0;
}