#include<iostream>
#include<cstdio>
#include<algorithm>
#include<vector>
#define N 1000000
using namespace std;
int read()
{
    char c=0;
    int sum=0,f=1;
    while (c!='-'&&(c<'0'||c>'9')) c=getchar();
    if (c=='-') c=getchar(),f=-1;
    while ('0'<=c&&c<='9') sum=sum*10+c-'0',c=getchar();
    return sum*f;
}
long long n,F[4],c[N+1],tong[N+1],length,in[N+1],ans,rst;
struct reads
{
    long long d[4];
};
reads a,zero;
inline reads operator + (reads a,int d)
{
    F[0]=1,F[1]=d,F[2]=(F[1]*(d-1))>>1,F[3]=F[2]*(d-2)/3;
    return (reads){a.d[0],a.d[0]*F[1]+a.d[1],a.d[0]*F[2]+a.d[1]*F[1]+a.d[2],a.d[0]*F[3]+a.d[1]*F[2]+a.d[2]*F[1]+a.d[3]};
}
inline reads operator + (reads a,reads b)
{
    return (reads){a.d[0]+b.d[0],a.d[1]+b.d[1],a.d[2]+b.d[2],a.d[3]+b.d[3]};
}
struct seg
{
    struct node
    {
	int l,r,lazy;
	reads data;
    };
    node tree[(N<<2)+1];
    void build(int k,int l,int r)
    {
	tree[k].l=l,tree[k].r=r,tree[k].data=(reads){r-l+1,0,0,0},tree[k].lazy=0;
	if (l==r) return;
	int mid=(l+r)>>1;
	build(k<<1,l,mid),build(k<<1|1,mid+1,r);
	return;
    }
    inline void push_up(int k)
    {
	tree[k].data=tree[k<<1].data+tree[k<<1|1].data;
	return;    
    }
    inline void spread(int k)
    {
	if (tree[k].lazy)
	{
	    tree[k<<1].data=tree[k<<1].data+tree[k].lazy,tree[k<<1].lazy+=tree[k].lazy;
	    tree[k<<1|1].data=tree[k<<1|1].data+tree[k].lazy,tree[k<<1|1].lazy+=tree[k].lazy;
	    tree[k].lazy=0;
	}
	return;
    }
    void add(int k,int l,int r,int d)
    {
	if (tree[k].l==l&&tree[k].r==r)
	{
	    tree[k].data=tree[k].data+d,tree[k].lazy+=d;
	    return;
	}
	spread(k);
	int mid=(tree[k].l+tree[k].r)>>1;
	if (r<=mid) add(k<<1,l,r,d);
	else if (l>=mid+1) add(k<<1|1,l,r,d);
	else add(k<<1,l,mid,d),add(k<<1|1,mid+1,r,d);
	push_up(k);
	return;
    }
};
seg T;
struct matrix
{
    int num,l,r,l2,r2;
    bool operator < (const matrix &t)const
    {
	return l<t.l;
    }
};
matrix mt[N+1],mt2[N+1];
struct lines
{
    int l,r,d;
};
vector<lines>p[N+1];
bool cmp(matrix x,matrix y)
{
    return x.r<y.r;
}
int lowbit(int x)
{
    return x&(-x);
}
void add(int x,int d)
{
    for (;x<=length;x+=lowbit(x)) c[x]+=d;
    return;
}
int Sum(int x)
{
    int res=0;
    for (;x>=1;x-=lowbit(x)) res+=c[x];
    return res;
}
inline void solve()
{
    int ps=0;
    for (int i=1;i<=n;++i) mt2[i]=mt[i];
    sort(mt+1,mt+n+1,cmp),sort(mt2+1,mt2+n+1);
    for (int i=1;i<=n;++i)
    {
	while (ps+1<=n&&mt[ps+1].r<mt2[i].l) ++ps;
	in[mt2[i].num]-=ps;
    }
    return;
}
inline void solve2()
{
    int ps=0;
    for (int i=1;i<=length;++i) c[i]=0;
    for (int i=1;i<=n;++i) mt2[i]=mt[i];
    sort(mt+1,mt+n+1,cmp),sort(mt2+1,mt2+n+1);
    for (int i=1;i<=n;++i)
    {
	while (ps+1<=n&&mt[ps+1].r<mt2[i].l) add(mt[++ps].r2,1);
	in[mt2[i].num]+=Sum(mt2[i].l2);
    }
    return;
}
inline void solve3(int d)
{
    long long res=0;
    T.build(1,1,length);
    for (int i=1;i<=length;++i) p[i].clear();
    for (int i=1;i<=n;++i) p[mt[i].l].push_back((lines){mt[i].l2,mt[i].r2,1}),p[mt[i].r+1].push_back((lines){mt[i].l2,mt[i].r2,-1});
    for (int i=1;i<=length;++i)
    {
	for (int j=0;j<p[i].size();++j) T.add(1,p[i][j].l,p[i][j].r,p[i][j].d);
	ans+=T.tree[1].data.d[3]*d,res+=T.tree[1].data.d[3]*d;
    }
    return;
}
int main()
{
    n=read(),ans=n*(n-1)*(n-2)/6;
    for (int i=1;i<=n;++i) mt[i].num=i,mt[i].l=read(),mt[i].r=read(),mt[i].l2=read(),mt[i].r2=read(),in[i]=n-1;
    for (int i=1;i<=n;++i) tong[++length]=mt[i].l,tong[++length]=mt[i].r;
    sort(tong+1,tong+length+1),length=unique(tong+1,tong+length+1)-tong-1;
    for (int i=1;i<=n;++i) mt[i].l=lower_bound(tong+1,tong+length+1,mt[i].l)-tong,mt[i].r=lower_bound(tong+1,tong+length+1,mt[i].r)-tong;
    for (int i=1;i<=n;++i) tong[++length]=mt[i].l2,tong[++length]=mt[i].r2;
    sort(tong+1,tong+length+1),length=unique(tong+1,tong+length+1)-tong-1;
    for (int i=1;i<=n;++i) mt[i].l2=lower_bound(tong+1,tong+length+1,mt[i].l2)-tong,mt[i].r2=lower_bound(tong+1,tong+length+1,mt[i].r2)-tong;
    //1
    solve();
    for (int i=1;i<=n;++i) mt[i].l=length+1-mt[i].l,mt[i].r=length+1-mt[i].r,swap(mt[i].l,mt[i].r);
    solve();
    for (int i=1;i<=n;++i) mt[i].l=length+1-mt[i].l,mt[i].r=length+1-mt[i].r,swap(mt[i].l,mt[i].r);
    for (int i=1;i<=n;++i) swap(mt[i].l,mt[i].l2),swap(mt[i].r,mt[i].r2);
    solve();
    for (int i=1;i<=n;++i) mt[i].l=length+1-mt[i].l,mt[i].r=length+1-mt[i].r,swap(mt[i].l,mt[i].r);
    solve();
    for (int i=1;i<=n;++i) mt[i].l=length+1-mt[i].l,mt[i].r=length+1-mt[i].r,swap(mt[i].l,mt[i].r);
    //2
    solve2();
    for (int i=1;i<=n;++i) mt[i].l=length+1-mt[i].l,mt[i].r=length+1-mt[i].r,swap(mt[i].l,mt[i].r);
    solve2();
    for (int i=1;i<=n;++i) mt[i].l2=length+1-mt[i].l2,mt[i].r2=length+1-mt[i].r2,swap(mt[i].l2,mt[i].r2);
    solve2();
    for (int i=1;i<=n;++i) mt[i].l=length+1-mt[i].l,mt[i].r=length+1-mt[i].r,swap(mt[i].l,mt[i].r);
    solve2();
    for (int i=1;i<=n;++i) mt[i].l2=length+1-mt[i].l2,mt[i].r2=length+1-mt[i].r2,swap(mt[i].l2,mt[i].r2);
    for (int i=1;i<=n;++i) rst+=in[i],ans+=(in[i]*(in[i]-1))>>1;
    ans-=(rst>>1)*(n-2);
    //3
    solve3(-1);
    for (int i=1;i<=n;++i) mt[i].r--;
    solve3(1);
    for (int i=1;i<=n;++i) mt[i].r2--;
    solve3(-1);
    for (int i=1;i<=n;++i) mt[i].r++;
    solve3(1);
    for (int i=1;i<=n;++i) mt[i].r2++;
    printf("%lld\n",ans);
    return 0;
}