#include <bits/stdc++.h>
using namespace std;
class Segment {
 public:
  long long x1, x2, y1, y2;
  Segment(long long a1, long long a2, long long b1, long long b2) {
    if (a1 > a2) swap(a1, a2);
    if (b1 > b2) swap(b1, b2);
    x1 = a1;
    x2 = a2;
    y1 = b1;
    y2 = b2;
  }
  bool isFlat() { return y1 == y2; }
};
bool intersect(Segment& a, Segment& b) {
  if (a.isFlat() and !b.isFlat())
    return (a.x1 <= b.x1 and b.x1 <= a.x2) and (b.y1 <= a.y1 and a.y1 <= b.y2);
  if (b.isFlat() and !a.isFlat())
    return (b.x1 <= a.x1 and a.x1 <= b.x2) and (a.y1 <= b.y1 and b.y1 <= a.y2);
  return false;
}
int main() {
  long long n;
  cin >> n;
  vector<Segment> h, v;
  for (long long i = 0; i < n; i++) {
    long long x1, x2, y1, y2;
    cin >> x1 >> y1 >> x2 >> y2;
    Segment s(x1, x2, y1, y2);
    if (s.isFlat())
      h.push_back(s);
    else
      v.push_back(s);
  }
  vector<vector<unsigned long long>> bits;
  for (long long i = 0; i < h.size(); i++) {
    vector<unsigned long long> tb;
    long long mask = 0, cnt = 0;
    for (long long j = 0; j < v.size(); j++) {
      if (intersect(h[i], v[j])) mask |= 1 << (j % 32);
      cnt++;
      if (cnt == 32) {
        tb.push_back(mask);
        mask = 0;
        cnt = 0;
      }
    }
    if (cnt) tb.push_back(mask);
    bits.push_back(tb);
  }
  long long ans = 0;
  for (long long i = 0; i < h.size(); i++) {
    for (long long j = i + 1; j < h.size(); j++) {
      long long x = 0;
      for (long long k = 0; k < bits[i].size(); k++)
        x += __builtin_popcount(bits[i][k] & bits[j][k]);
      ans += (x * (x - 1)) / 2;
    }
  }
  cout << ans;
  return 0;
}

### Prompt

Your task is to create 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;
class Segment {
 public:
  long long x1, x2, y1, y2;
  Segment(long long a1, long long a2, long long b1, long long b2) {
    if (a1 > a2) swap(a1, a2);
    if (b1 > b2) swap(b1, b2);
    x1 = a1;
    x2 = a2;
    y1 = b1;
    y2 = b2;
  }
  bool isFlat() { return y1 == y2; }
};
bool intersect(Segment& a, Segment& b) {
  if (a.isFlat() and !b.isFlat())
    return (a.x1 <= b.x1 and b.x1 <= a.x2) and (b.y1 <= a.y1 and a.y1 <= b.y2);
  if (b.isFlat() and !a.isFlat())
    return (b.x1 <= a.x1 and a.x1 <= b.x2) and (a.y1 <= b.y1 and b.y1 <= a.y2);
  return false;
}
int main() {
  long long n;
  cin >> n;
  vector<Segment> h, v;
  for (long long i = 0; i < n; i++) {
    long long x1, x2, y1, y2;
    cin >> x1 >> y1 >> x2 >> y2;
    Segment s(x1, x2, y1, y2);
    if (s.isFlat())
      h.push_back(s);
    else
      v.push_back(s);
  }
  vector<vector<unsigned long long>> bits;
  for (long long i = 0; i < h.size(); i++) {
    vector<unsigned long long> tb;
    long long mask = 0, cnt = 0;
    for (long long j = 0; j < v.size(); j++) {
      if (intersect(h[i], v[j])) mask |= 1 << (j % 32);
      cnt++;
      if (cnt == 32) {
        tb.push_back(mask);
        mask = 0;
        cnt = 0;
      }
    }
    if (cnt) tb.push_back(mask);
    bits.push_back(tb);
  }
  long long ans = 0;
  for (long long i = 0; i < h.size(); i++) {
    for (long long j = i + 1; j < h.size(); j++) {
      long long x = 0;
      for (long long k = 0; k < bits[i].size(); k++)
        x += __builtin_popcount(bits[i][k] & bits[j][k]);
      ans += (x * (x - 1)) / 2;
    }
  }
  cout << ans;
  return 0;
}

```