#include <bits/stdc++.h>
using namespace std;
const int N = 1e4 + 100;
int BIT[N];
void Up(int u, int v) {
  for (; u < N; u += u & -u) BIT[u] += v;
}
int Get(int u) {
  int ans = 0;
  for (; u > 0; u -= u & -u) ans += BIT[u];
  return ans;
}
vector<pair<pair<int, int>, int> > Ver;
vector<pair<int, pair<int, int> > > Hor;
long long f(int x) { return 1ll * x * (x - 1) / 2; }
int main() {
  int n;
  cin >> n;
  for (int i = 0; i < n; ++i) {
    int x1, y1, x2, y2;
    cin >> x1 >> y1 >> x2 >> y2;
    x1 += 5e3 + 10;
    y1 += 5e3 + 10;
    x2 += 5e3 + 10;
    y2 += 5e3 + 10;
    if (x1 > x2) {
      swap(x1, x2);
    }
    if (y1 > y2) {
      swap(y1, y2);
    }
    if (x1 == x2) {
      Ver.push_back(make_pair(pair<int, int>(y2, y1), x1));
    } else
      Hor.push_back(make_pair(y1, pair<int, int>(x1, x2)));
  }
  sort(Hor.begin(), Hor.end());
  sort(Ver.begin(), Ver.end());
  long long ans = 0;
  for (int i = 0; i < Hor.size(); ++i) {
    for (auto x : Ver)
      if (x.first.second <= Hor[i].first) {
        Up(x.second, 1);
      }
    int it = 0;
    for (int j = i + 1; j < Hor.size(); ++j) {
      while (it < Ver.size() && Ver[it].first.first < Hor[j].first) {
        if (Ver[it].first.second <= Hor[i].first) Up(Ver[it].second, -1);
        ++it;
      }
      int L = max(Hor[i].second.first, Hor[j].second.first);
      int R = min(Hor[i].second.second, Hor[j].second.second);
      if (L <= R) ans += f(Get(R) - Get(L - 1));
    }
    while (it < Ver.size()) {
      if (Ver[it].first.second <= Hor[i].first) Up(Ver[it].second, -1);
      ++it;
    }
  }
  cout << ans;
}

### Prompt

In CPP, your task is to solve 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 = 1e4 + 100;
int BIT[N];
void Up(int u, int v) {
  for (; u < N; u += u & -u) BIT[u] += v;
}
int Get(int u) {
  int ans = 0;
  for (; u > 0; u -= u & -u) ans += BIT[u];
  return ans;
}
vector<pair<pair<int, int>, int> > Ver;
vector<pair<int, pair<int, int> > > Hor;
long long f(int x) { return 1ll * x * (x - 1) / 2; }
int main() {
  int n;
  cin >> n;
  for (int i = 0; i < n; ++i) {
    int x1, y1, x2, y2;
    cin >> x1 >> y1 >> x2 >> y2;
    x1 += 5e3 + 10;
    y1 += 5e3 + 10;
    x2 += 5e3 + 10;
    y2 += 5e3 + 10;
    if (x1 > x2) {
      swap(x1, x2);
    }
    if (y1 > y2) {
      swap(y1, y2);
    }
    if (x1 == x2) {
      Ver.push_back(make_pair(pair<int, int>(y2, y1), x1));
    } else
      Hor.push_back(make_pair(y1, pair<int, int>(x1, x2)));
  }
  sort(Hor.begin(), Hor.end());
  sort(Ver.begin(), Ver.end());
  long long ans = 0;
  for (int i = 0; i < Hor.size(); ++i) {
    for (auto x : Ver)
      if (x.first.second <= Hor[i].first) {
        Up(x.second, 1);
      }
    int it = 0;
    for (int j = i + 1; j < Hor.size(); ++j) {
      while (it < Ver.size() && Ver[it].first.first < Hor[j].first) {
        if (Ver[it].first.second <= Hor[i].first) Up(Ver[it].second, -1);
        ++it;
      }
      int L = max(Hor[i].second.first, Hor[j].second.first);
      int R = min(Hor[i].second.second, Hor[j].second.second);
      if (L <= R) ans += f(Get(R) - Get(L - 1));
    }
    while (it < Ver.size()) {
      if (Ver[it].first.second <= Hor[i].first) Up(Ver[it].second, -1);
      ++it;
    }
  }
  cout << ans;
}

```