#include <bits/stdc++.h>

#define fi first
#define se second
#define DB double
#define U unsigned
#define P std::pair
#define LL long long
#define LD long double
#define pb emplace_back
#define MP std::make_pair
#define SZ(x) ((int)x.size())
#define all(x) x.begin(),x.end()
#define CLR(i,a) memset(i,a,sizeof(i))
#define FOR(i,a,b) for(int i = a;i <= b;++i)
#define ROF(i,a,b) for(int i = a;i >= b;--i)
#define DEBUG(x) std::cerr << #x << '=' << x << std::endl

const int MAXN = 1e5 + 5;
int A[MAXN],B[MAXN],C[MAXN],D[MAXN],a[MAXN],tmpa[MAXN],n;
LL ans = 0;
P<int,int> b[MAXN],tmpb[MAXN];

struct BIT{
    #define lowbit(x) ((x)&(-(x)))
    int tree[MAXN],ts[MAXN],now;
    BIT(){now = 0;}
    inline void clear(){++now;}

    inline void add(int p,int x){
        for(;p < MAXN;p += lowbit(p)){
            if(ts[p] != now) tree[p] = 0,ts[p] = now;
            tree[p] += x;
        }
    }

    inline int query(int p){
        int res = 0;
        for(;p;p -= lowbit(p)){
            if(ts[p] != now) tree[p] = 0,ts[p] = now;
            res += tree[p];
        }
        return res;
    }
}bit;

inline void cdq2(int l,int r){
    if(l == r) return;
    int mid = (l + r) >> 1;
    cdq2(l,mid);cdq2(mid+1,r);
    int p1 = l,p2 = mid+1,t = l-1;bit.clear();
    while(p1 <= mid && p2 <= r){
        if(C[b[p1].fi] < C[b[p2].fi]){
            if(!b[p1].se) bit.add(D[b[p1].fi],1);
            tmpb[++t] = b[p1++];
        }
        else{
            if(b[p2].se) ans += bit.query(D[b[p2].fi]-1);
            tmpb[++t] = b[p2++];
        }
    }
//    FOR(i,l,r) printf("%d %d\n",b[i].fi,b[i].se);
    FOR(i,p1,mid) tmpb[++t] = b[i];
    FOR(i,p2,r){
        tmpb[++t] = b[i];
        if(b[i].se) ans += bit.query(D[b[i].fi]-1);
    }
    FOR(i,l,r) b[i] = tmpb[i];
}

inline void cdq1(int l,int r){
    if(l == r) return;
    int mid = (l + r) >> 1;
    cdq1(l,mid);cdq1(mid+1,r);
    // 0 = add 1 = qry
    int p1 = l,p2 = mid+1,tot = 0,t = l-1;
    while(p1 <= mid && p2 <= r){
        if(B[a[p1]] < B[a[p2]]) b[++tot] = MP(a[p1],0),tmpa[++t] = a[p1++];
        else b[++tot] = MP(a[p2],1),tmpa[++t] = a[p2++];
    }
    FOR(i,p1,mid) tmpa[++t] = a[i];
    FOR(i,p2,r) b[++tot] = MP(a[i],1),tmpa[++t] = a[i];
//    DEBUG(l);DEBUG(r);
    cdq2(1,tot);
    FOR(i,l,r) a[i] = tmpa[i];
}

int main(){
    //freopen("A.in","r",stdin);
    //freopen("A.out","w",stdout);
    scanf("%d",&n);
    FOR(i,1,n) scanf("%d%d%d%d",A+i,B+i,C+i,D+i),a[i] = i;
    std::sort(a+1,a+n+1,[&](int x,int y){return A[x] < A[y];});
    cdq1(1,n);
    printf("%lld\n",ans);
    return 0;
}