#include <bits/stdc++.h>
using namespace std;
const int N = 11000, mod = 1e9 + 7;
inline int read() {
  int x = 0, f = 1;
  char ch = getchar();
  while (ch < '0' || ch > '9') {
    if (ch == '-') f = -1;
    ch = getchar();
  }
  while (ch >= '0' && ch <= '9') {
    x = (x << 1) + (x << 3) + (ch ^ 48);
    ch = getchar();
  }
  return x * f;
}
pair<int, pair<int, int>> v[N], h[N];
int n;
inline int lowbit(int x) { return x & -x; }
int c[N];
void add(int x, int y) {
  while (x < N) {
    c[x] += y;
    x += lowbit(x);
  }
}
int sum(int x) {
  int res = 0;
  while (x) {
    res += c[x];
    x -= lowbit(x);
  }
  return res;
}
bool cmp(pair<int, pair<int, int>> a, pair<int, pair<int, int>> b) {
  return a.second < b.second;
}
priority_queue<pair<int, int>, vector<pair<int, int>>, greater<pair<int, int>>>
    q;
bool check(int i, int j) {
  return h[i].second.first <= v[j].first && v[j].first <= h[i].second.second &&
         v[j].second.first <= h[i].first && h[i].first <= v[j].second.second;
}
void solve() {
  n = read();
  int nv = 0, nh = 0;
  long long ans = 0;
  for (int i = 1; i <= n; ++i) {
    int x1 = read() + 5002, y1 = read() + 5002, x2 = read() + 5002,
        y2 = read() + 5002;
    if (x1 == x2) {
      v[++nv] = {x1, {min(y1, y2), max(y1, y2)}};
    } else if (y1 == y2) {
      h[++nh] = {y1, {min(x1, x2), max(x1, x2)}};
    }
  }
  sort(v + 1, v + 1 + nv);
  sort(h + 1, h + 1 + nh, cmp);
  for (int i = 1; i <= nv; ++i) {
    for (int j = i + 1, k = 1; j <= nv; ++j) {
      while (k <= nh && h[k].second.first <= v[j].first) {
        if (check(k, i)) {
          q.push({h[k].second.second, k});
          add(h[k].first, 1);
        }
        k++;
      }
      while (q.size() && q.top().first < v[j].first) {
        add(h[q.top().second].first, -1);
        q.pop();
      }
      int t = sum(v[j].second.second) - sum(v[j].second.first - 1);
      ans += (long long)t * (t - 1) / 2;
    }
    while (q.size()) {
      add(h[q.top().second].first, -1);
      q.pop();
    }
  }
  cout << ans << '\n';
}
int main() {
  int T = 1;
  while (T--) {
    solve();
  }
  return 0;
}

### Prompt

Please formulate a cpp solution to the following problem:

There are n segments drawn on a plane; the i-th segment connects two points (x_{i, 1}, y_{i, 1}) and (x_{i, 2}, y_{i, 2}). Each segment is non-degenerate, and is either horizontal or vertical — formally, for every i ∈ [1, n] either x_{i, 1} = x_{i, 2} or y_{i, 1} = y_{i, 2} (but only one of these conditions holds). Only segments of different types may intersect: no pair of horizontal segments shares any common points, and no pair of vertical segments shares any common points.

We say that four segments having indices h_1, h_2, v_1 and v_2 such that h_1 < h_2 and v_1 < v_2 form a rectangle if the following conditions hold:

  * segments h_1 and h_2 are horizontal; 
  * segments v_1 and v_2 are vertical; 
  * segment h_1 intersects with segment v_1; 
  * segment h_2 intersects with segment v_1; 
  * segment h_1 intersects with segment v_2; 
  * segment h_2 intersects with segment v_2. 



Please calculate the number of ways to choose four segments so they form a rectangle. Note that the conditions h_1 < h_2 and v_1 < v_2 should hold.

Input

The first line contains one integer n (1 ≤ n ≤ 5000) — the number of segments.

Then n lines follow. The i-th line contains four integers x_{i, 1}, y_{i, 1}, x_{i, 2} and y_{i, 2} denoting the endpoints of the i-th segment. All coordinates of the endpoints are in the range [-5000, 5000].

It is guaranteed that each segment is non-degenerate and is either horizontal or vertical. Furthermore, if two segments share a common point, one of these segments is horizontal, and another one is vertical.

Output

Print one integer — the number of ways to choose four segments so they form a rectangle.

Examples

Input


7
-1 4 -1 -2
6 -1 -2 -1
-2 3 6 3
2 -2 2 4
4 -1 4 3
5 3 5 1
5 2 1 2


Output


7


Input


5
1 5 1 0
0 1 5 1
5 4 0 4
4 2 4 0
4 3 4 5


Output


0

Note

The following pictures represent sample cases:

<image> <image>

### Response

```cpp
#include <bits/stdc++.h>
using namespace std;
const int N = 11000, mod = 1e9 + 7;
inline int read() {
  int x = 0, f = 1;
  char ch = getchar();
  while (ch < '0' || ch > '9') {
    if (ch == '-') f = -1;
    ch = getchar();
  }
  while (ch >= '0' && ch <= '9') {
    x = (x << 1) + (x << 3) + (ch ^ 48);
    ch = getchar();
  }
  return x * f;
}
pair<int, pair<int, int>> v[N], h[N];
int n;
inline int lowbit(int x) { return x & -x; }
int c[N];
void add(int x, int y) {
  while (x < N) {
    c[x] += y;
    x += lowbit(x);
  }
}
int sum(int x) {
  int res = 0;
  while (x) {
    res += c[x];
    x -= lowbit(x);
  }
  return res;
}
bool cmp(pair<int, pair<int, int>> a, pair<int, pair<int, int>> b) {
  return a.second < b.second;
}
priority_queue<pair<int, int>, vector<pair<int, int>>, greater<pair<int, int>>>
    q;
bool check(int i, int j) {
  return h[i].second.first <= v[j].first && v[j].first <= h[i].second.second &&
         v[j].second.first <= h[i].first && h[i].first <= v[j].second.second;
}
void solve() {
  n = read();
  int nv = 0, nh = 0;
  long long ans = 0;
  for (int i = 1; i <= n; ++i) {
    int x1 = read() + 5002, y1 = read() + 5002, x2 = read() + 5002,
        y2 = read() + 5002;
    if (x1 == x2) {
      v[++nv] = {x1, {min(y1, y2), max(y1, y2)}};
    } else if (y1 == y2) {
      h[++nh] = {y1, {min(x1, x2), max(x1, x2)}};
    }
  }
  sort(v + 1, v + 1 + nv);
  sort(h + 1, h + 1 + nh, cmp);
  for (int i = 1; i <= nv; ++i) {
    for (int j = i + 1, k = 1; j <= nv; ++j) {
      while (k <= nh && h[k].second.first <= v[j].first) {
        if (check(k, i)) {
          q.push({h[k].second.second, k});
          add(h[k].first, 1);
        }
        k++;
      }
      while (q.size() && q.top().first < v[j].first) {
        add(h[q.top().second].first, -1);
        q.pop();
      }
      int t = sum(v[j].second.second) - sum(v[j].second.first - 1);
      ans += (long long)t * (t - 1) / 2;
    }
    while (q.size()) {
      add(h[q.top().second].first, -1);
      q.pop();
    }
  }
  cout << ans << '\n';
}
int main() {
  int T = 1;
  while (T--) {
    solve();
  }
  return 0;
}

```