#include <bits/stdc++.h>
using namespace std;
struct seg {
  long long x1, y1, x2, y2;
};
bool cmp(const seg &i, const seg &j) { return i.x1 < j.x1; }
struct fenwickTree {
  vector<long long> bit;
  long long n;
  fenwickTree(long long _n) {
    n = _n;
    bit.assign(n, 0);
  }
  long long sum(long long r) {
    long long ret = 0;
    for (; r >= 0; r = (r & (r + 1)) - 1) ret += bit[r];
    return ret;
  }
  void add(long long idx, long long d) {
    for (; idx < n; idx = idx | (idx + 1)) bit[idx] += d;
  }
  long long sum(long long l, long long r) { return sum(r) - sum(l - 1); }
};
signed main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  long long n;
  cin >> n;
  vector<seg> ver, hor;
  for (long long i = 0; i < n; ++i) {
    long long x1, y1, x2, y2;
    cin >> x1 >> y1 >> x2 >> y2;
    if (x1 > x2) swap(x1, x2);
    if (y1 > y2) swap(y1, y2);
    if (x1 == x2) {
      ver.push_back({x1, y1, x2, y2});
    } else {
      hor.push_back({x1, y1, x2, y2});
    }
  }
  sort(ver.begin(), ver.end(), cmp);
  sort(hor.begin(), hor.end(), cmp);
  long long res = 0;
  for (long long i = 0; i < (long long)ver.size(); ++i) {
    long long posHor = 0;
    fenwickTree ft(10010);
    for (long long j = 0; j < i; ++j) {
      while (posHor < (long long)hor.size() && hor[posHor].x1 <= ver[j].x1) {
        if (ver[i].y1 <= hor[posHor].y1 && hor[posHor].y2 <= ver[i].y2) {
          if (hor[posHor].x2 >= ver[i].x2) {
            ft.add(hor[posHor].y1 + 5000, 1);
          }
        }
        ++posHor;
      }
      long long L = max(ver[i].y1, ver[j].y1) + 5000;
      long long R = min(ver[i].y2, ver[j].y2) + 5000;
      if (L <= R) {
        long long cnt = ft.sum(L, R);
        res += cnt * (cnt - 1) / 2;
      }
    }
  }
  cout << res << '\n';
}
