#include <bits/stdc++.h>
using namespace std;
const int MAXN = 1e5 + 7;
int T[MAXN];
void Tadd(int x, int y) {
  for (; x < MAXN; x += x & -x) T[x] += y;
}
int Tsum(int x) {
  int ret = 0;
  for (; x; x -= x & -x) ret += T[x];
  return ret;
}
long long ans;
int ansn[MAXN];
const int LEN = 5001;
vector<pair<int, pair<int, int> > > x, y;
struct Point {
  int x, y, op;
  Point() {}
  Point(int _x, int _y, int _op) {
    x = _x;
    y = _y;
    op = _op;
  }
};
bool cmp(Point a, Point b) {
  if (a.x == b.x && a.y == b.y) return a.op > b.op;
  if (a.x == b.x) return a.y < b.y;
  return a.x < b.x;
}
vector<Point> vec;
int main() {
  int n;
  scanf("%d", &n);
  y.push_back(make_pair(0, make_pair(0, 0)));
  for (int i = 1; i <= n; i++) {
    int x1, y1, x2, y2;
    scanf("%d %d %d %d", &x1, &y1, &x2, &y2);
    x1 += LEN;
    y1 += LEN;
    x2 += LEN;
    y2 += LEN;
    if (x1 > x2) swap(x1, x2);
    if (y1 > y2) swap(y1, y2);
    if (x1 == x2) x.push_back(make_pair(x1, make_pair(y1, y2)));
    if (y1 == y2) y.push_back(make_pair(y1, make_pair(x1, x2)));
  }
  sort(y.begin(), y.end());
  for (int i = y.size() - 1; i; i--) {
    auto ii = y[i];
    for (int j = 0; j < x.size(); j++) {
      auto jj = x[j];
      if (ii.second.first <= jj.first && jj.first <= ii.second.second &&
          jj.second.first < ii.first && ii.first <= jj.second.second) {
        vec.push_back(Point(jj.first, jj.second.first, LEN));
      }
    }
    for (int j = i - 1; j; j--) {
      auto jj = y[j];
      vec.push_back(Point(jj.second.first - 1, jj.first, -j));
      vec.push_back(Point(jj.second.second, jj.first, j));
    }
    sort(vec.begin(), vec.end(), cmp);
    for (auto it : vec) {
      if (it.op == LEN) {
        Tadd(it.y, 1);
      } else {
        int id = it.op < 0 ? -it.op : it.op;
        ansn[id] += (it.op < 0 ? -1 : 1) * Tsum(it.y);
      }
    }
    for (int j = i - 1; j >= 0; j--) {
      ans += (long long)ansn[j] * (ansn[j] - 1) / 2;
      ansn[j] = 0;
    }
    for (auto it : vec) {
      if (it.op == LEN) Tadd(it.y, -1);
    }
    vec.clear();
  }
  printf("%lld", ans);
  return 0;
}

### Prompt

Create a solution in cpp for 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 MAXN = 1e5 + 7;
int T[MAXN];
void Tadd(int x, int y) {
  for (; x < MAXN; x += x & -x) T[x] += y;
}
int Tsum(int x) {
  int ret = 0;
  for (; x; x -= x & -x) ret += T[x];
  return ret;
}
long long ans;
int ansn[MAXN];
const int LEN = 5001;
vector<pair<int, pair<int, int> > > x, y;
struct Point {
  int x, y, op;
  Point() {}
  Point(int _x, int _y, int _op) {
    x = _x;
    y = _y;
    op = _op;
  }
};
bool cmp(Point a, Point b) {
  if (a.x == b.x && a.y == b.y) return a.op > b.op;
  if (a.x == b.x) return a.y < b.y;
  return a.x < b.x;
}
vector<Point> vec;
int main() {
  int n;
  scanf("%d", &n);
  y.push_back(make_pair(0, make_pair(0, 0)));
  for (int i = 1; i <= n; i++) {
    int x1, y1, x2, y2;
    scanf("%d %d %d %d", &x1, &y1, &x2, &y2);
    x1 += LEN;
    y1 += LEN;
    x2 += LEN;
    y2 += LEN;
    if (x1 > x2) swap(x1, x2);
    if (y1 > y2) swap(y1, y2);
    if (x1 == x2) x.push_back(make_pair(x1, make_pair(y1, y2)));
    if (y1 == y2) y.push_back(make_pair(y1, make_pair(x1, x2)));
  }
  sort(y.begin(), y.end());
  for (int i = y.size() - 1; i; i--) {
    auto ii = y[i];
    for (int j = 0; j < x.size(); j++) {
      auto jj = x[j];
      if (ii.second.first <= jj.first && jj.first <= ii.second.second &&
          jj.second.first < ii.first && ii.first <= jj.second.second) {
        vec.push_back(Point(jj.first, jj.second.first, LEN));
      }
    }
    for (int j = i - 1; j; j--) {
      auto jj = y[j];
      vec.push_back(Point(jj.second.first - 1, jj.first, -j));
      vec.push_back(Point(jj.second.second, jj.first, j));
    }
    sort(vec.begin(), vec.end(), cmp);
    for (auto it : vec) {
      if (it.op == LEN) {
        Tadd(it.y, 1);
      } else {
        int id = it.op < 0 ? -it.op : it.op;
        ansn[id] += (it.op < 0 ? -1 : 1) * Tsum(it.y);
      }
    }
    for (int j = i - 1; j >= 0; j--) {
      ans += (long long)ansn[j] * (ansn[j] - 1) / 2;
      ansn[j] = 0;
    }
    for (auto it : vec) {
      if (it.op == LEN) Tadd(it.y, -1);
    }
    vec.clear();
  }
  printf("%lld", ans);
  return 0;
}

```