#include<bits/stdc++.h>
#define ll long long
using namespace std;
bool stmemory;
namespace Call_me_Eric{
inline int read(){
    int x = 0, f = 1;char ch = getchar();
    while(ch < '0' || ch > '9'){if(ch == '-') f = -1;ch = getchar();}
    while(ch >= '0' && ch <= '9'){x = (x << 1) + (x << 3) + (ch ^ 48);ch = getchar();}
    return x * f;
}
const int maxn = 5e5 + 10;
int n, sid;
int l[maxn], r[maxn], d[maxn], u[maxn];
struct mtx{
    int l, r, d, u, id;
    mtx(int l = 0,int r = 0,int d = 0,int u = 0,int id = 0)
    :l(l),r(r),d(d),u(u),id(id){}
}a[maxn];
int X[maxn], Y[maxn];
int totX, totY;
struct BIT{
    int c[maxn];
    void clear(){memset(c,0,sizeof(c));}
    inline int lowbit(int x){return x & (-x);}
    int qry(int x){int s = 0;for(;x;x -= lowbit(x))s += c[x];return s;}
    void upd(int x,int add){for(;x < maxn;x += lowbit(x))c[x] += add;}
}tr1,tr2;
int sum[maxn];//与i矩形相交的矩形有sum[i]个
int sl[maxn],sr[maxn],su[maxn],sd[maxn];
vector<int> vecl[maxn], vecr[maxn];


struct Segment_Tree{
    struct data{
        ll cl, cr, cnt;
        data(ll cl = 0,ll cr = 0,ll cnt = 0)
        :cl(cl),cr(cr),cnt(cnt){}
        friend data operator + (data a,data b){
            data res = data();
            res.cl = a.cl + b.cl;res.cr = a.cr + b.cr;
            res.cnt = a.cnt + b.cnt + a.cr * b.cl;
            return res;
        }
    };
    struct node{data v;node(data v = data()):v(v){}}d[maxn << 2];
    node mergenode(node l,node r){return node(l.v + r.v);}
    void build(int l,int r,int p){
        if(l == r){d[p] = node();return;}
        int mid = l + r >> 1;
        build(l,mid,p << 1);build(mid + 1,r,p << 1 | 1);
        d[p] = mergenode(d[p << 1],d[p << 1 | 1]);
    }
    void update(int l,int r,int pos,int p,int typ,int upd){//typ = 0,update l;typ = 1,update r
        if(l == r && l == pos){
            d[p].v.cl += upd * !typ; d[p].v.cr += upd * typ;
            d[p].v.cnt = d[p].v.cl * d[p].v.cr;return;
        }
        int mid = l + r >> 1;
        if(pos <= mid)update(l,mid,pos ,p << 1,typ,upd);
        else update(mid + 1,r,pos,p << 1 | 1,typ,upd);
        d[p] = mergenode(d[p << 1],d[p << 1 | 1]);
    }
    node query(int l,int r,int s,int t,int p){
        if(s <= l && r <= t)return d[p];
        int mid = l + r >> 1;
        if(t <= mid)return query(l,mid,s,t,p << 1);
        if(mid < s)return query(mid + 1,r,s,t,p << 1 | 1);
        return mergenode(query(l,mid,s,t,p << 1),query(mid + 1,r,s,t,p << 1 | 1));
    }
    void update(int pos,int typ,int upd){update(1,totY,pos,1,typ,upd);}
    node query(int l,int r){if(r < l)return node();return query(1,totY,l,r,1);}
    void build(){build(1,totY,1);}
}tree;

void main(){
    n = read();
    // sid = read();
    for(int i = 1;i <= n;i++){X[i * 2 - 1] = l[i] = read(); X[i * 2] = r[i] = read() + 1; Y[i * 2 - 1] = d[i] = read();Y[i * 2] = u[i] = read() + 1;}
    sort(X + 1,X + 1 + 2 * n);sort(Y + 1,Y + 1 + 2 * n);
    totX = unique(X + 1,X + 1 + 2 * n) - X - 1, totY = unique(Y + 1,Y + 1 + 2 * n) - Y - 1;
    for(int i = 1;i <= n;i++){
        l[i] = lower_bound(X + 1,X + 1 + totX,l[i]) - X; r[i] = lower_bound(X + 1,X + 1 + totX,r[i]) - X;
        d[i] = lower_bound(Y + 1,Y + 1 + totY,d[i]) - Y; u[i] = lower_bound(Y + 1,Y + 1 + totY,u[i]) - Y;
        // printf("i = %d, l = %d, r = %d, d = %d, u = %d\n",i,l[i],r[i],d[i],u[i]);
        a[i] = mtx(l[i],r[i],d[i],u[i],i);
        sr[l[i]]++;sl[r[i]]++;sd[u[i]]++;su[d[i]]++;
        vecl[l[i]].push_back(i);vecr[r[i]].push_back(i);
    }

    for(int i = 1;i <= totX;i++)sl[i] += sl[i - 1]; for(int i = totX;i;i--)sr[i] += sr[i + 1];
    for(int i = 1;i <= totY;i++)sd[i] += sd[i - 1]; for(int i = totY;i;i--)su[i] += su[i + 1];
    for(int i = 1;i <= n;i++)sum[a[i].id] = (sl[a[i].l] + sr[a[i].r] + sd[a[i].d] + su[a[i].u]);

    tr1.clear();tr2.clear();
    for(int i = 1;i <= totX;i++){
        for(int x : vecr[i])tr1.upd(a[x].u,1), tr2.upd(a[x].d,1);
        for(int x : vecl[i])sum[x] -= tr2.qry(maxn - 1) - tr2.qry(a[x].u - 1) + tr1.qry(a[x].d);
    }

    tr1.clear();tr2.clear();
    for(int i = totX;i;i--){
        for(int x : vecl[i])tr1.upd(a[x].u,1), tr2.upd(a[x].d,1);
        for(int x : vecr[i])sum[x] -= tr2.qry(maxn - 1) - tr2.qry(a[x].u - 1) + tr1.qry(a[x].d);
    }
    // for(int i = 1;i <= n;i++)cerr << "i = " << i << " sum = " << sum[i] << endl;

    ll ans = 1ll * n * (n - 1) * (n - 2) / 3;
    for(int i = 1;i <= n;i++)ans -= 1ll * sum[i] * (n - sum[i] - 1);
    ans >>= 1;
    tr1.clear();tr2.clear();tree.build();ll cnt = 0, res = 0;
    for(int i = 1;i <= totX;i++){
        for(int x : vecr[i]){
            tr1.upd(a[x].d,-1);tree.update(a[x].d,0,-1);
            tr2.upd(a[x].u,-1);tree.update(a[x].u,1,-1);
            cnt--;
        }
        for(int x : vecl[i]){
            ll num = tr1.qry(maxn - 1) - tr1.qry(a[x].u - 1) + tr2.qry(a[x].d);
            // cerr << "num = " << num << " cnt = " << cnt << endl;
            num = cnt - num;ll val = num * (num - 1) / 2;
            auto tmp = tree.query(a[x].d + 1,a[x].u - 1).v;
            val -= tmp.cnt;res += val;
            // cerr << "i = " << i << " val = " << val << endl;
            tr1.upd(a[x].d,1);tree.update(a[x].d,0,1);
            tr2.upd(a[x].u,1);tree.update(a[x].u,1,1);
            cnt++;
        }
    }
    // cerr << "res = " << res << endl;
    printf("%lld\n",ans - res);
    return;
}
};
bool edmemory;
signed main(){
    auto stclock = clock();
    Call_me_Eric::main();
    auto edclock = clock();
    cerr << (&stmemory - &edmemory) / 1024.0 / 1024.0 << " Mib cost.\n";
    cerr << (edclock - stclock) * 1.0 / CLOCKS_PER_SEC << " Sec cost.\n";
    return 0;
}