#include<iostream>
#include<cstring>
#include<vector>
#include<algorithm>
using namespace std;
using LL = long long;
enum type {LEFT, RIGHT};

const int maxn = 1e5 + 5;

namespace BIT{

int tr[maxn];

int lowbit(int x){
    return x & -x;
}

void modify(int x, int v){
    while(x < maxn){
        tr[x] += v;
        x += lowbit(x);
    }
}

int query(int x){
    int ans = 0;
    while(x > 0){
        ans += tr[x];
        x -= lowbit(x);
    }
    return ans;
}

}

struct Node{
    int a, b, c, d, type;

    bool operator<(const Node &t) const {
        return a < t.a;
    }

}p[maxn], q[maxn], w[maxn];

LL solve(int l, int r){
    if (l >= r) return 0LL;
    int mid = (l + r) / 2;
    int pl = l, pr = mid + 1, pt = l;
    LL ans = solve(l, mid) + solve(mid + 1, r);
    while(pl <= mid and pr <= r){
        if (q[pl].c < q[pr].c){
            if (q[pl].type == LEFT){
                BIT::modify(q[pl].d, 1);
            }
            w[pt++] = q[pl++];
        }
        else{
            if (q[pr].type == RIGHT){
                ans += BIT::query(q[pr].d - 1);
            }
            w[pt++] = q[pr++];
        }
    }
    while(pl <= mid){
        if (q[pl].type == LEFT){
            BIT::modify(q[pl].d, 1);
        }
        w[pt++] = q[pl++];
    }
    while(pr <= r){
        if (q[pr].type == RIGHT){
            ans += BIT::query(q[pr].d - 1);
        }
        w[pt++] = q[pr++];
    }
    for(int i = l; i <= mid; i++){
        if (q[i].type == LEFT){
            BIT::modify(q[i].d, -1);
        }
    }
    for(int i = l; i <= r; i++) q[i] = w[i];
    return ans;
}

LL cdq(int l, int r){
    if (l >= r) return 0LL;
    int mid = (l + r) / 2;
    LL ans = cdq(l, mid) + cdq(mid + 1, r);
    int pl = l, pr = mid + 1, pt = l;
    while(pl <= mid and pr <= r){
        if (p[pl].b < p[pr].b){
            q[pt++] = p[pl++];
            q[pt - 1].type = LEFT;
        }
        else{
            q[pt++] = p[pr++];
            q[pt - 1].type = RIGHT;
        }
    }
    while(pl <= mid){
        q[pt++] = p[pl++];
        q[pt - 1].type = LEFT;
    }
    while(pr <= r){
        q[pt++] = p[pr++];
        q[pt - 1].type = RIGHT;
    }
    for(int i = l; i <= r; i++){
        p[i] = q[i];
    }
    ans += solve(l, r);
    return ans;
}

int main(){

#ifdef LOCAL
    freopen("data.in", "r", stdin);
    freopen("data.out", "w", stdout);
#endif

    cin.tie(0);
    cout.tie(0);
    ios::sync_with_stdio(0);

    int n;
    cin >> n;
    for(int i = 1; i <= n; i++){
        cin >> p[i].a >> p[i].b >> p[i].c >> p[i].d;
    }
    sort(p + 1, p + n + 1);
    cout << cdq(1, n) << '\n';

}