#include <bits/stdc++.h>
#define For(i, a, b) for(int (i)=(int)(a); (i)<(int)(b); ++(i))
#define rFor(i, a, b) for(int (i)=(int)(a)-1; (i)>=(int)(b); --(i))
#define rep(i, n) For((i), 0, (n))
#define rrep(i, n) rFor((i), (n), 0)
#define fi first
#define se second
using namespace std;
typedef long long lint;
typedef unsigned long long ulint;
typedef pair<int, int> pii;
typedef pair<lint, lint> pll;
template<class T> bool chmax(T &a, const T &b){if(a<b){a=b; return true;} return false;}
template<class T> bool chmin(T &a, const T &b){if(a>b){a=b; return true;} return false;}
template<class T> T div_floor(T a, T b){
    if(b < 0) a *= -1, b *= -1;
    return a>=0 ? a/b : (a+1)/b-1;
}
template<class T> T div_ceil(T a, T b){
    if(b < 0) a *= -1, b *= -1;
    return a>0 ? (a-1)/b+1 : a/b;
}

constexpr lint mod = 1000000007;
constexpr lint INF = mod * mod;
constexpr int MAX = 200010;

template<typename T, typename E, typename F, typename G>
struct SegTree{
    int sz = 1, seq_sz;
    T et;
    F f;
    G g;
    vector<T> node;

    SegTree(int sz_, T et, F f, G g): seq_sz(sz_), et(et), f(f), g(g){
        while(sz<sz_) sz <<= 1;
        node.resize(sz<<1, et);
    }

    void build(vector<T> &a){
        rep(i, a.size()) node[i+sz] = a[i];
        rFor(i, sz, 1) node[i] = f(node[i<<1], node[(i<<1)+1]);
    }

    void build(T x){
        rep(i, seq_sz) node[i+sz] = x;
        rFor(i, sz, 1) node[i] = f(node[i<<1], node[(i<<1)+1]);
    }

    void update(int i, E x){
        i += sz;
        node[i] = g(node[i], x);
        i >>= 1;
        while(i){
            node[i] = f(node[i<<1], node[(i<<1)+1]);
            i >>= 1;
        }
    }

    T query(int l, int r){
        T vl = et, vr = et;
        for(l+=sz, r+=sz; l<r; l>>=1, r>>=1){
            if(l&1) vl = f(vl, node[l++]);
            if(r&1) vr = f(node[--r], vr);
        }
        return f(vl, vr);
    }

    int search_left(int l, const T val, function<bool(T, T)> cmp, function<bool(T, T)> check){
        T sum = et;
        for(l+=sz; ; l>>=1){
            if(check(f(sum, node[l]), val)){
                while(l < sz){
                    if(check(f(sum, node[l<<1]), val)) l <<= 1;
                    else{
                        sum = f(sum, node[l<<1]);
                        l = (l<<1) + 1;
                    }
                }
                return l-sz;
            }
            if(__builtin_popcount(l+1) == 1) return seq_sz;
            if(l&1) sum = f(sum, node[l++]);
        }
    }

    int search_right(int r, const T val, function<bool(T, T)> cmp, function<bool(T, T)> check){
        T sum = et;
        for(r+=sz; ; r>>=1){
            if(check(f(sum, node[r]), val)){
                while(r < sz){
                    if(check(f(node[(r<<1)+1], sum), val)) r = (r<<1) + 1;
                    else{
                        sum = f(node[(r<<1)+1], sum);
                        r<<=1;
                    }
                }
                return r-sz;
            }
            if(__builtin_popcount(r) == 1) return -1;
            if(!(r&1)) sum = f(node[r--], sum);
        }
    }

    int lower_bound_left(int l, const T val, function<bool(T, T)> cmp=less<>()){
        auto check = [&cmp](auto a, auto b){return !cmp(a, b);};
        return search_left(l, val, cmp, check);
    }

    int upper_bound_left(int l, const T val, function<bool(T, T)> cmp=less<>()){
        auto check = [&cmp](auto a, auto b){return cmp(b, a);};
        return search_left(l, val, cmp, check);
    }

    int lower_bound_right(int l, const T val, function<bool(T, T)> cmp=greater<>()){
        auto check = [&cmp](auto a, auto b){return !cmp(b, a);};
        return search_right(l, val, cmp, check);
    }

    int upper_bound_right(int l, const T val, function<bool(T, T)> cmp=greater<>()){
        auto check = [&cmp](auto a, auto b){return cmp(a, b);};
        return search_right(l, val, cmp, check);
    }
};

struct seg_v{
    int x, sy, ty;
    seg_v(int x, int s, int t): x(x), sy(s), ty(t){}
};

struct seg_h{
    int y, sx, tx;
    seg_h(int y, int s, int t): y(y), sx(s), tx(t){}
};

int main(){
    int n;
    scanf("%d", &n);
    vector<seg_v> segv;
    vector<int> vy;
    auto cmp1 = [](const seg_h &a, const seg_h &b){return a.sx > b.sx;};
    auto cmp2 = [](const seg_h &a, const seg_h &b){return a.tx > b.tx;};
    priority_queue<seg_h, vector<seg_h>, decltype(cmp1)> que1(cmp1);
    priority_queue<seg_h, vector<seg_h>, decltype(cmp2)> que2(cmp2);
    rep(_, n){
        int sx, sy, tx, ty;
        scanf("%d%d%d%d", &sx, &sy, &tx, &ty);
        vy.push_back(sy); vy.push_back(ty);
        if(sx == tx){
            segv.push_back({sx, min(sy, ty), max(sy, ty)});
        }
        else{
            que1.push({ty, min(sx, tx), max(sx, tx)});
        }
    }
    sort(vy.begin(), vy.end());
    vy.erase(unique(vy.begin(), vy.end()), vy.end());
    SegTree<lint, lint, decltype(plus<>()), decltype(plus<>())> st(vy.size(), 0, plus<>(), plus<>());
    sort(segv.begin(), segv.end(), [](const seg_v &a, const seg_v &b){return a.x < b.x;});

    lint ans = 0;
    for(auto sv: segv){
        while(!que1.empty() && que1.top().sx <= sv.x){
            auto tmp = que1.top();
            que1.pop();
            int idx = lower_bound(vy.begin(), vy.end(), tmp.y) - vy.begin();
            st.update(idx, 1);
            que2.push(tmp);
        }
        while(!que2.empty() && que2.top().tx < sv.x){
            auto tmp = que2.top();
            que2.pop();
            int idx = lower_bound(vy.begin(), vy.end(), tmp.y) - vy.begin();
            st.update(idx, -1);
        }

        int l = lower_bound(vy.begin(), vy.end(), sv.sy) - vy.begin();
        int r = lower_bound(vy.begin(), vy.end(), sv.ty) - vy.begin();
        ans += st.query(l, r+1);
    }
    printf("%lld\n", ans);
}


Measured memory_bytes: 8656