#include <bits/stdc++.h>
using namespace std;
inline long long read() {
  char ch = getchar();
  long long nega = 1;
  while (!isdigit(ch)) {
    if (ch == '-') nega = -1;
    ch = getchar();
  }
  long long ans = 0;
  while (isdigit(ch)) {
    ans = ans * 10 + ch - 48;
    ch = getchar();
  }
  if (nega == -1) return -ans;
  return ans;
}
struct Node {
  long long x1, y1, x2, y2;
};
Node a[5005], b[5005];
long long n;
bitset<5005> s[5005];
bitset<5005> x;
bool judge(Node x, Node y) {
  if (y.y1 <= x.y1 && x.y1 <= y.y2 && x.x1 <= y.x1 && y.x1 <= x.x2) return true;
  return false;
}
signed main() {
  cin >> n;
  long long c, d, e, f;
  long long sa = 0, sb = 0;
  for (long long i = 1; i <= n; i++) {
    c = read(), d = read(), e = read(), f = read();
    if (c == e) {
      if (d > f) swap(d, f);
      b[++sb].x1 = c;
      b[sb].y1 = d;
      b[sb].x2 = e;
      b[sb].y2 = f;
    } else {
      if (c > e) swap(c, e);
      a[++sa].x1 = c;
      a[sa].y1 = d;
      a[sa].x2 = e;
      a[sa].y2 = f;
    }
  }
  if (sa < sb) {
    for (long long i = 1; i <= sa; i++) {
      s[i].reset();
      for (long long j = 1; j <= sb; j++) {
        if (judge(a[i], b[j])) {
          s[i].set(j);
        }
      }
    }
    long long ans = 0;
    for (long long i = 1; i <= sa; i++) {
      for (long long j = i + 1; j <= sa; j++) {
        x.reset();
        x = s[i] & s[j];
        long long dat = x.count();
        ans += dat * (dat - 1) / 2;
      }
    }
    cout << ans << endl;
  } else {
    for (long long i = 1; i <= sb; i++) {
      s[i].reset();
      for (long long j = 1; j <= sa; j++) {
        if (judge(a[j], b[i])) {
          s[i].set(j);
        }
      }
    }
    long long ans = 0;
    for (long long i = 1; i <= sb; i++) {
      for (long long j = i + 1; j <= sb; j++) {
        x.reset();
        x = s[i] & s[j];
        long long dat = x.count();
        ans += dat * (dat - 1) / 2;
      }
    }
    cout << ans << endl;
  }
  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;
inline long long read() {
  char ch = getchar();
  long long nega = 1;
  while (!isdigit(ch)) {
    if (ch == '-') nega = -1;
    ch = getchar();
  }
  long long ans = 0;
  while (isdigit(ch)) {
    ans = ans * 10 + ch - 48;
    ch = getchar();
  }
  if (nega == -1) return -ans;
  return ans;
}
struct Node {
  long long x1, y1, x2, y2;
};
Node a[5005], b[5005];
long long n;
bitset<5005> s[5005];
bitset<5005> x;
bool judge(Node x, Node y) {
  if (y.y1 <= x.y1 && x.y1 <= y.y2 && x.x1 <= y.x1 && y.x1 <= x.x2) return true;
  return false;
}
signed main() {
  cin >> n;
  long long c, d, e, f;
  long long sa = 0, sb = 0;
  for (long long i = 1; i <= n; i++) {
    c = read(), d = read(), e = read(), f = read();
    if (c == e) {
      if (d > f) swap(d, f);
      b[++sb].x1 = c;
      b[sb].y1 = d;
      b[sb].x2 = e;
      b[sb].y2 = f;
    } else {
      if (c > e) swap(c, e);
      a[++sa].x1 = c;
      a[sa].y1 = d;
      a[sa].x2 = e;
      a[sa].y2 = f;
    }
  }
  if (sa < sb) {
    for (long long i = 1; i <= sa; i++) {
      s[i].reset();
      for (long long j = 1; j <= sb; j++) {
        if (judge(a[i], b[j])) {
          s[i].set(j);
        }
      }
    }
    long long ans = 0;
    for (long long i = 1; i <= sa; i++) {
      for (long long j = i + 1; j <= sa; j++) {
        x.reset();
        x = s[i] & s[j];
        long long dat = x.count();
        ans += dat * (dat - 1) / 2;
      }
    }
    cout << ans << endl;
  } else {
    for (long long i = 1; i <= sb; i++) {
      s[i].reset();
      for (long long j = 1; j <= sa; j++) {
        if (judge(a[j], b[i])) {
          s[i].set(j);
        }
      }
    }
    long long ans = 0;
    for (long long i = 1; i <= sb; i++) {
      for (long long j = i + 1; j <= sb; j++) {
        x.reset();
        x = s[i] & s[j];
        long long dat = x.count();
        ans += dat * (dat - 1) / 2;
      }
    }
    cout << ans << endl;
  }
  return 0;
}

```