#include <bits/stdc++.h>
using namespace std;
const int N = 100001;
int seg[N], hor[N], x[N][2], y[N][2], p[N];
void update(int r, int add) {
  while (r < N) {
    seg[r] += add;
    r += r & (-r);
  }
}
int query(int r) {
  int ans = 0;
  while (r < N && r > 0) {
    ans += seg[r];
    r -= r & (-r);
  }
  return ans;
}
bool cmp(int i, int j) {
  if (x[i][0] != x[j][0]) {
    return x[i][0] < x[j][0];
  }
  if (hor[i] + hor[j] <= 1) {
    return hor[i];
  }
  return x[i][1] < x[j][1];
}
int n;
long long ans = 0;
void calc(int idx) {
  memset(seg, 0, sizeof(seg));
  priority_queue<pair<int, int>, vector<pair<int, int> >,
                 greater<pair<int, int> > >
      q;
  for (int i = 1; i < idx; i++) {
    if (hor[p[i]]) {
      update(y[p[i]][0], 1);
      q.push({x[p[i]][1] + 1, i});
    }
  }
  for (int i = idx + 1; i <= n; i++) {
    while (q.size() && q.top().first <= x[p[i]][0]) {
      update(y[p[q.top().second]][0], -1);
      q.pop();
    }
    int cnt = query(min(y[p[idx]][1], y[p[i]][1])) -
              query(max(y[p[idx]][0], y[p[i]][0]) - 1);
    if (cnt > 0) {
      ans += 1LL * cnt * (cnt - 1) / 2;
    }
  }
}
int main() {
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) {
    for (int j = 0; j < 2; j++) {
      scanf("%d %d", &x[i][j], &y[i][j]);
      x[i][j] += 5001, y[i][j] += 5001;
    }
    if (x[i][0] == x[i][1]) {
      hor[i] = 0;
    } else {
      hor[i] = 1;
    }
    if (x[i][0] > x[i][1]) {
      swap(x[i][0], x[i][1]);
      swap(y[i][0], y[i][1]);
    } else if (y[i][0] > y[i][1]) {
      swap(x[i][0], x[i][1]);
      swap(y[i][0], y[i][1]);
    }
    p[i] = i;
  }
  sort(p + 1, p + n + 1, cmp);
  for (int i = 1; i <= n; i++) {
    if (hor[p[i]] == 0) {
      calc(i);
    }
  }
  printf("%lld\n", ans);
  return 0;
}
