#include <bits/stdc++.h>
const double Pi = 3.14159265;
const int N = 1e4 + 20;
const unsigned long long base = 163;
const int INF = 0x3f3f3f3f;
const int mod = 1e9 + 7;
const double eps = 1e-10;
const double pi = acos(-1);
using namespace std;
int n, m;
int val[N];
void add(int x, int w) {
  for (; x < N; x += x & -x) {
    val[x] += w;
  }
}
int sum(int x) {
  int ans = 0;
  for (; x; x -= x & -x) {
    ans += val[x];
  }
  return ans;
}
pair<int, pair<int, int> > row[N], col[N];
int st[N], sz = 0;
int main() {
  scanf("%d", &n);
  int r = 0, c = 0;
  for (int i = 1; i <= n; ++i) {
    int a1, b1, a2, b2;
    scanf("%d%d%d%d", &a1, &b1, &a2, &b2);
    a1 += 5005;
    b1 += 5005;
    a2 += 5005;
    b2 += 5005;
    if (a1 == a2) {
      if (b1 > b2) swap(b1, b2);
      col[++c] = {a1, {b1, b2}};
    } else {
      if (a1 > a2) swap(a1, a2);
      row[++r] = {a2, {a1, b1}};
    }
  }
  sort(row + 1, row + 1 + r);
  sort(col + 1, col + 1 + c);
  long long ans = 0;
  for (int i = 1; i <= c; ++i) {
    int rr = r + 1;
    memset(val, 0, sizeof(val));
    sz = 0;
    for (int j = 1; j <= r; ++j) {
      if (row[j].second.first <= col[i].first)
        add(row[j].second.second, 1), st[++sz] = j;
    }
    int pos = 1;
    for (int j = i + 1; j <= c; ++j) {
      while (row[st[pos]].first < col[j].first && pos <= sz)
        add(row[st[pos]].second.second, -1), pos++;
      int MIN = min(col[i].second.second, col[j].second.second);
      int MAX = max(col[i].second.first, col[j].second.first);
      if (MAX > MIN) continue;
      int now = sum(MIN) - sum(MAX - 1);
      ans += 1LL * now * (now - 1) / 2;
    }
  }
  cout << ans << endl;
  return 0;
}
