#include<bits/stdc++.h>
#define pii pair<int,int>
#define fi first
#define se second
#define mk make_pair
#define pb push_back
#define lb(x) (x&(-x))
#define ll long long 
using namespace std;
const int N=4e5+100,inf=1e10;
struct Uni
{
	vector<int>vt;
	Uni(){vt.push_back(-inf);}
	void push(int x){vt.push_back(x);}
	void build(){sort(vt.begin(),vt.end());vt.erase(unique(vt.begin(),vt.end()),vt.end());}
	int qry(int x){return lower_bound(vt.begin(),vt.end(),x)-vt.begin();}
};
int n,mx,my;
struct Matrix{int sx,sy,ex,ey;}a[N];
Uni XX,YY;
int deg[N];
namespace GetDeg
{
	struct BIT
	{
		ll c[N];
		void add(int x,int y){for(;x<N;x+=lb(x))c[x]+=y;}
		int ask(int x){int t=0;for(;x;x-=lb(x))t+=c[x];return t;}
		int ask(int l,int r){return ask(r)-ask(l-1);}
	}T1,T2;
	int tot=0;
	vector<int>g[N],q[N];
	void add(int l,int r,int v){T1.add(r,v);T2.add(l,v);tot+=v;}
	int ask(int l,int r){return tot-T1.ask(l-1)-T2.ask(r+1,my);}
	void work()
	{
		for(int i=1;i<=n;i++)deg[i]=0,q[a[i].sx].pb(i),g[a[i].sx].pb(i),g[a[i].ex+1].pb(-i);
		for(int i=1;i<=mx+1;i++)
		{
			for(auto y:g[i])add(a[abs(y)].sy,a[abs(y)].ey,y>0?1:-1);
			for(auto y:q[i])deg[y]+=ask(a[y].sy,a[y].ey);
			g[i].clear();q[i].clear();
		}
		tot=0;
		for(int i=1;i<=n;i++)q[a[i].sx].pb(-i),q[a[i].ex].pb(i),g[a[i].sx].pb(i);
		for(int i=1;i<=mx+1;i++)
		{
			for(auto y:g[i])add(a[y].sy,a[y].ey,1);
			for(auto y:q[i])deg[abs(y)]+=(y>0?1:-1)*ask(a[abs(y)].sy,a[abs(y)].ey);
			g[i].clear();q[i].clear();
		}
	}
}
ll C(int n,int m){if(!m)return 1;if(m==1)return n;if(m==2)return 1ll*n*(n-1)/2;if(m==3)return 1ll*n*(n-1)/2*(n-2)/3;}
namespace Gets3
{
	namespace T
	{
		#define ls (x<<1)
		#define rs (x<<1|1)
		#define midd ((L+R)>>1)
		ll val[N<<2][4];int laz[N<<2];
		void push(int x,int v)
		{
			static ll tmp[4];memset(tmp,0,sizeof(tmp));
			for(int i=0;i<=3;i++)
				for(int j=0;j<=i;j++)
					tmp[i]+=val[x][j]*C(v,i-j);
			memcpy(val[x],tmp,sizeof(val[x]));laz[x]+=v;
		}
		void pushdown(int x){push(ls,laz[x]);push(rs,laz[x]);laz[x]=0;}
		void pushup(int x){for(int i=0;i<=3;i++)val[x][i]=val[ls][i]+val[rs][i];}
		void build(int x,int L,int R)
		{
			laz[x]=0;val[x][0]=1;val[x][1]=val[x][2]=val[x][3]=0;
			if(L==R)return;
			int mid=midd;
			build(ls,L,mid);build(rs,mid+1,R);
			pushup(x);
		}
		void update(int x,int l,int r,int L,int R,int v)
		{
			if(l<=L&&R<=r)return push(x,v);
			pushdown(x);
			const int mid=midd;
			if(l<=mid)update(ls,l,r,L,mid,v);
			if(r>mid)update(rs,l,r,mid+1,R,v);
			pushup(x);
		}
	}
	vector<int>g[N];
	ll solve(int dx,int dy,int v)
	{
		ll res=0;T::build(1,1,my+1);
		for(int i=1;i<=n;i++)g[a[i].sx+dx].push_back(i),g[a[i].ex+1].push_back(-i);
		for(int i=1;i<=mx+1+dx;i++)
		{
			for(auto y:g[i])T::update(1,a[abs(y)].sy+dy,a[abs(y)].ey,1,my+1,y>0?1:-1);
			res+=v*T::val[1][3];
			g[i].clear();
		}
		return res;
	}
	ll work(){return solve(0,0,1)+solve(1,0,-1)+solve(0,1,-1)+solve(1,1,1);}
}
signed main()
{
//	freopen("land.in","r",stdin);
//	freopen("land.out","w",stdout);
	scanf("%d",&n);
	for(int i=1;i<=n;i++)
	{
		scanf("%d%d%d%d",&a[i].sx,&a[i].ex,&a[i].sy,&a[i].ey);
		XX.push(a[i].sx);XX.push(a[i].ex);YY.push(a[i].sy);YY.push(a[i].ey);
	}
	XX.build();YY.build();mx=XX.vt.size();my=YY.vt.size();
	for(int i=1;i<=n;i++)a[i].sx=XX.qry(a[i].sx),a[i].ex=XX.qry(a[i].ex),a[i].sy=YY.qry(a[i].sy),a[i].ey=YY.qry(a[i].ey);
	GetDeg::work();
	ll A=0,B=0,C=Gets3::work(); 
	for(int i=1;i<=n;i++)deg[i]--,A+=1ll*(n-deg[i]-1)*(n-deg[i]-2)/2,B+=1ll*deg[i]*(deg[i]-1)/2;
	printf("%lld\n",(A+B-2*C-1ll*n*(n-1)/2*(n-2)/3)/2);
	return 0;
}