#include <bits/stdc++.h>
using namespace std;
const long long inf = 1e18;
const long double pi = 3.141592653589793238;
const long long MOD = 1000000007;
const long long N = 2e5 + 10, delta = 5e3 + 1;
long long n;
class cl {
 public:
  long long x1, y1, x2, y2;
};
vector<cl> horizontal, vertical;
vector<cl> v[N], h[N], vadded[N];
bool cmp1(cl a, cl b) { return a.y1 < b.y1; }
long long fen[2 * delta];
void add(long long i, long long val) {
  while (i < 2 * delta) {
    fen[i] += val;
    i += (i & (-i));
  }
}
long long sum(long long i) {
  long long s = 0;
  while (i > 0) {
    s += fen[i];
    i -= (i & (-i));
  }
  return s;
}
long long range(long long l, long long r) {
  return sum(r) - (l > 0 ? sum(l - 1) : 0);
}
void solve() {
  cin >> n;
  for (long long i = 0; i < n; i++) {
    long long x1, y1, x2, y2;
    cin >> x1 >> y1 >> x2 >> y2;
    y1 += delta;
    y2 += delta;
    x1 += delta;
    x2 += delta;
    if (y1 > y2) swap(y1, y2);
    if (x1 > x2) swap(x1, x2);
    if (x1 == x2)
      v[y1].push_back({x1, y1, x2, y2}), v[y2].push_back({x1, y1, x2, y2});
    else
      horizontal.push_back({x1, y1, x2, y2}), h[y1].push_back({x1, y1, x2, y2});
  }
  sort(horizontal.begin(), horizontal.end(), cmp1);
  long long res = 0;
  for (long long i = 0; i < (long long)horizontal.size(); i++) {
    for (long long j = 0; j < 2 * delta; j++) fen[j] = 0;
    long long left = 0;
    for (long long y = 0; y <= horizontal[i].y1; y++) {
      for (auto x : v[y]) {
        if (x.y2 > horizontal[i].y1 && x.x1 >= horizontal[i].x1 &&
            x.x1 <= horizontal[i].x2)
          add(x.x1, 1), vadded[x.y2].push_back(x), left++;
      }
    }
    for (long long y = horizontal[i].y1 + 1; y < 2 * delta && left > 0; y++) {
      for (auto x : h[y]) {
        long long s = range(x.x1, x.x2);
        res += (s * (s - 1)) / 2;
      }
      for (auto x : vadded[y]) {
        add(x.x1, -1);
      }
      left -= (long long)vadded[y].size();
      vadded[y].clear();
    }
  }
  cout << res;
}
signed main() {
  ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);
  long long t = 1;
  while (t--) {
    solve();
  }
}

### Prompt

Please provide a cpp coded solution to the problem described below:

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 long long inf = 1e18;
const long double pi = 3.141592653589793238;
const long long MOD = 1000000007;
const long long N = 2e5 + 10, delta = 5e3 + 1;
long long n;
class cl {
 public:
  long long x1, y1, x2, y2;
};
vector<cl> horizontal, vertical;
vector<cl> v[N], h[N], vadded[N];
bool cmp1(cl a, cl b) { return a.y1 < b.y1; }
long long fen[2 * delta];
void add(long long i, long long val) {
  while (i < 2 * delta) {
    fen[i] += val;
    i += (i & (-i));
  }
}
long long sum(long long i) {
  long long s = 0;
  while (i > 0) {
    s += fen[i];
    i -= (i & (-i));
  }
  return s;
}
long long range(long long l, long long r) {
  return sum(r) - (l > 0 ? sum(l - 1) : 0);
}
void solve() {
  cin >> n;
  for (long long i = 0; i < n; i++) {
    long long x1, y1, x2, y2;
    cin >> x1 >> y1 >> x2 >> y2;
    y1 += delta;
    y2 += delta;
    x1 += delta;
    x2 += delta;
    if (y1 > y2) swap(y1, y2);
    if (x1 > x2) swap(x1, x2);
    if (x1 == x2)
      v[y1].push_back({x1, y1, x2, y2}), v[y2].push_back({x1, y1, x2, y2});
    else
      horizontal.push_back({x1, y1, x2, y2}), h[y1].push_back({x1, y1, x2, y2});
  }
  sort(horizontal.begin(), horizontal.end(), cmp1);
  long long res = 0;
  for (long long i = 0; i < (long long)horizontal.size(); i++) {
    for (long long j = 0; j < 2 * delta; j++) fen[j] = 0;
    long long left = 0;
    for (long long y = 0; y <= horizontal[i].y1; y++) {
      for (auto x : v[y]) {
        if (x.y2 > horizontal[i].y1 && x.x1 >= horizontal[i].x1 &&
            x.x1 <= horizontal[i].x2)
          add(x.x1, 1), vadded[x.y2].push_back(x), left++;
      }
    }
    for (long long y = horizontal[i].y1 + 1; y < 2 * delta && left > 0; y++) {
      for (auto x : h[y]) {
        long long s = range(x.x1, x.x2);
        res += (s * (s - 1)) / 2;
      }
      for (auto x : vadded[y]) {
        add(x.x1, -1);
      }
      left -= (long long)vadded[y].size();
      vadded[y].clear();
    }
  }
  cout << res;
}
signed main() {
  ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);
  long long t = 1;
  while (t--) {
    solve();
  }
}

```