#include <bits/stdc++.h>
using namespace std;
const int maxn = 5000 + 10;
struct HLine {
  int xa, xb, y;
  bool operator<(const HLine& rhs) const { return y < rhs.y; }
};
struct Node {
  int y, x, flag;
  bool operator<(const Node& rhs) const { return y < rhs.y; }
};
int cnt;
vector<HLine> h;
vector<Node> a;
int x[2 * maxn];
int c[2 * maxn];
int vis[2 * maxn];
void add(int pos, int val) {
  for (int i = pos; i <= cnt; i += i & (-i)) c[i] += val;
}
int sum(int pos) {
  int res = 0;
  for (int i = pos; i; i -= i & (-i)) res += c[i];
  return res;
}
int main() {
  int n;
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) {
    int xa, ya, xb, yb;
    scanf("%d%d%d%d", &xa, &ya, &xb, &yb);
    x[++cnt] = xa;
    x[++cnt] = xb;
    if (xa == xb) {
      a.push_back((Node){min(ya, yb), xa, 1});
      a.push_back((Node){max(ya, yb), xa, -1});
    } else
      h.push_back((HLine){min(xa, xb), max(xa, xb), ya});
  }
  sort(a.begin(), a.end());
  sort(h.begin(), h.end());
  sort(x + 1, x + cnt + 1);
  cnt = unique(x + 1, x + cnt + 1) - (x + 1);
  for (int i = 0; i < h.size(); i++) {
    h[i].xa = lower_bound(x + 1, x + cnt + 1, h[i].xa) - x;
    h[i].xb = lower_bound(x + 1, x + cnt + 1, h[i].xb) - x;
  }
  for (int i = 0; i < a.size(); i++)
    a[i].x = lower_bound(x + 1, x + cnt + 1, a[i].x) - x;
  long long ans = 0;
  for (int i = 0; i < h.size(); i++) {
    int pos = -1;
    while (pos + 1 < a.size() && a[pos + 1].y <= h[i].y) {
      pos++;
      if (a[pos].flag < 0)
        add(a[pos].x, -1);
      else
        add(a[pos].x, 1);
    }
    for (int j = i + 1; j < h.size(); j++) {
      while (pos + 1 < a.size() && a[pos + 1].y < h[j].y) {
        pos++;
        if (a[pos].flag < 0) {
          if (vis[a[pos].x])
            vis[a[pos].x]--;
          else
            add(a[pos].x, -1);
        } else
          vis[a[pos].x]++;
      }
      int L = max(h[i].xa, h[j].xa);
      int R = min(h[i].xb, h[j].xb);
      if (R < L) continue;
      int num = sum(R) - sum(L - 1);
      ans += num * (num - 1) / 2;
    }
    while (pos + 1 < a.size()) {
      pos++;
      if (a[pos].flag < 0) {
        if (vis[a[pos].x])
          vis[a[pos].x]--;
        else
          add(a[pos].x, -1);
      } else
        vis[a[pos].x]++;
    }
  }
  printf("%lld\n", ans);
  return 0;
}
