// compile: make data
// run: ./data < data.in
#include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
#ifdef LOCAL
#include <debug/codeforces.h>
#define debug(x...) _debug_print(#x, x);
#define Debug(x...) _debug_print_format(#x, x);
std::ifstream terminal("/dev/tty");
#define PP cerr<<"\033[1;30mpause...\e[0m",terminal.ignore();
#else
#define debug(x...)
#define Debug(x...)
#define PP
#endif
template<typename...Args> void print_(Args...args){((cout<<args<<" "),...)<<endl;}
#define rep(i,a,b) for(int i=(a);i<(int)(b);++i)
#define sz(v) ((int)(v).size())
#define print(...) print_(__VA_ARGS__);
#define FIND(a, x) ((find(a.begin(),a.end(),(x))!=a.end())?1:0)
#define cmin(x,...) x=min({(x),__VA_ARGS__})
#define cmax(x,...) x=max({(x),__VA_ARGS__})
#define INTMAX (int)(9223372036854775807)
#define INF (int)(1152921504606846976)
#define NaN (int)(0x8b88e1d0595d51d1)
#define double long double
#define int long long
#define uint unsigned long long
#define MAXN 1000010
 
struct bitree {
    int n;
    vector<vector<int>> c;
    vector<int> sum;
    bitree(vector<int> &a) {
        n = sz(a); sum.push_back(0);
        rep(i, 0, n) sum.push_back(sum[i] + a[i]);
        c.resize(2, vector<int>(n+1, 0));
    }
    int lowbit(int x) {return x & (-x); }
    void add(int b, int x, int y) {for (; x <= n; x += lowbit(x)) c[b][x] += y; }
    int get(int b, int x) {int ans = 0; for (; x; x -= lowbit(x)) ans += c[b][x]; return ans; }
    void modify(int p, int k) {modify(p, p, k); }
    void modify(int l, int r, int k) {add(0, l+1, k); add(0, r+2, -k); add(1, l+1, (l+1)*k); add(1, r+2, -(r+2)*k); }
    int query(int p) {return query(p, p); }
    int query(int l, int r) {int ans = sum[r+1] + (r+2)*get(0, r+1) - get(1, r+1); ans -= sum[l] + (l+1)*get(0, l) - get(1, l); return ans; }
};
 
int32_t main() {
    ios::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr);
 
    struct event {
        int y, x, del, l, r;
    };
    int n; cin >> n;
    vector<event> a;
    rep(i, 0, n) {
        int x1, y1, x2, y2; cin >> x1 >> y1 >> x2 >> y2;
        x1 += MAXN, y1 += MAXN, x2 += MAXN, y2 += MAXN;
        if (y1 == y2) a.push_back({y1, 0, 0, min(x1, x2), max(x1, x2)});
        else a.push_back({min(y1, y2), x1, 1, 0, 0}), a.push_back({max(y1, y2), x1, -1, 0, 0});
    }
    sort(a.begin(), a.end(), [](event A, event B) {
        return A.y < B.y;
    });
    vector<int> sum(2*MAXN);
    bitree t(sum);
    int ans = 0;
    for (auto [y, x, del, l, r]: a) {
        if (x == 0) ans += t.query(l, r);
        else t.modify(x, del);
    }
    cout << ans << endl;
 
    return 0;
}