#include<bits/stdc++.h>
using namespace std;
#define i64 __int128
#define ll long long
#define pb push_back
#define fi first
#define se second
#define pii pair<int,int>
#define lowbit(i) i&(-i)
const int N = 5e5+5; 
ll n,tot[N];
struct sgt{
    ll cnt[2],tot,w;
}s[N*4];
struct node{
    ll l,r,d,u;
}a[N];
bool cmp(node x,node y){
    return x.u>y.u;
}
sgt merge(sgt x,sgt y){
    sgt res;
    res.tot = x.tot+y.tot;
    res.cnt[0] = x.cnt[0]+y.cnt[0];
    res.cnt[1] = x.cnt[1]+y.cnt[1];
    res.w = x.w+y.w+x.cnt[1]*y.cnt[0];
    return res;
}
void modify(int l,int r,int u,int p,int typ,int w){
    if(l==r){
        s[u].tot+=w;
        s[u].cnt[typ]+=w;
        return ;
    }
    int mid = (l+r)>>1;
    if(p<=mid) modify(l,mid,u*2,p,typ,w);
    else modify(mid+1,r,u*2+1,p,typ,w);
    s[u] = merge(s[u*2],s[u*2+1]);
}
sgt ask(int l,int r,int u,int sl,int sr){
    if(sl>r || l>sr){
        sgt res;
        res.cnt[0] = res.cnt[1] = 0;
        res.tot = res.w = 0;
        return res;
    }
    if(sl<=l && r<=sr) return s[u];
    int mid = (l+r)>>1;
    return merge(ask(l,mid,u*2,sl,sr),ask(mid+1,r,u*2+1,sl,sr));
}
vector<pii> id[N];
ll get_c3(){
    ll res = 0;
    for(int i=1;i<=n;i++){
        id[a[i].l].pb({i,1});
        id[a[i].r].pb({i,-1});
    }
    for(int i=1;i<=2*n;i++){
        for(auto x:id[i]){
            if(x.se == 1){
                ll sum = s[1].tot/2-ask(1,2*n,1,1,a[x.fi].d-1).cnt[1]-ask(1,2*n,1,a[x.fi].u+1,2*n).cnt[0];
                sum = sum*(sum-1)/2;
                sum -= ask(1,2*n,1,a[x.fi].d,a[x.fi].u).w;
                res += sum;
            }
        }
        for(auto x:id[i]){
            modify(1,2*n,1,a[x.fi].d,0,x.se);
            modify(1,2*n,1,a[x.fi].u,1,x.se);
        }
    }
    return res;
}
void get_tot(){
    for(int i=1;i<=2*n;i++){
        for(auto x:id[i]){
            if(x.se == 1){
                tot[x.fi] += s[1].tot/2-ask(1,2*n,1,1,a[x.fi].d-1).cnt[1]-ask(1,2*n,1,a[x.fi].u+1,2*n).cnt[0];
            }
        }
        for(auto x:id[i]){
            modify(1,2*n,1,a[x.fi].d,0,x.se);
            modify(1,2*n,1,a[x.fi].u,1,x.se);
        }
    }
    for(int i=1;i<=2*n;i++){
        for(auto x:id[i]){
            ll w = s[1].tot/2-ask(1,2*n,1,1,a[x.fi].d-1).cnt[1]-ask(1,2*n,1,a[x.fi].u+1,2*n).cnt[0];
            if(x.se == 1){
                tot[x.fi] -= w;
            }else{
                tot[x.fi] += w;
            }
        }
        for(auto x:id[i]){
            if(x.se==1){
                modify(1,2*n,1,a[x.fi].d,0,x.se);
                modify(1,2*n,1,a[x.fi].u,1,x.se);
            }
        }
    }
}
int main() {
    cin.tie(0),cout.tie(0);
    ios::sync_with_stdio(0);
    cin >> n;
    vector<int> tmpx,tmpy;
    for(int i=1;i<=n;i++) cin >> a[i].l >> a[i].r >> a[i].d >> a[i].u;
    for(int i=1;i<=n;i++) tmpx.pb(a[i].l),tmpx.pb(a[i].r),tmpy.pb(a[i].d),tmpy.pb(a[i].u);
    sort(tmpx.begin(),tmpx.end()),sort(tmpy.begin(),tmpy.end());
    tmpx.erase(unique(tmpx.begin(),tmpx.end()),tmpx.end());
    tmpy.erase(unique(tmpy.begin(),tmpy.end()),tmpy.end());
    for(int i=1;i<=n;i++){
        a[i].l = lower_bound(tmpx.begin(),tmpx.end(),a[i].l)-tmpx.begin()+1;
        a[i].r = lower_bound(tmpx.begin(),tmpx.end(),a[i].r)-tmpx.begin()+1;
        a[i].d = lower_bound(tmpy.begin(),tmpy.end(),a[i].d)-tmpy.begin()+1;
        a[i].u = lower_bound(tmpy.begin(),tmpy.end(),a[i].u)-tmpy.begin()+1;
    }
    ll c3 = get_c3();
    get_tot();
    ll ans = 0;
    for(int i=1;i<=n;i++) tot[i]--;
    for(int i=1;i<=n;i++) ans += tot[i]*(n-2)-tot[i]*(tot[i]-1);
    ans /= 2,ans += c3;
    ans = n*(n-1)*(n-2)/6-ans;
    cout << ans;
	return 0;
}