#include <bits/stdc++.h>
using namespace std;
template <class T>
void _R(T &x) {
  cin >> x;
}
void _R(int &x) { scanf("%d", &x); }
void _R(long long &x) { scanf("%lld", &x); }
void _R(double &x) { scanf("%lf", &x); }
void _R(char &x) { scanf(" %c", &x); }
void _R(char *x) { scanf("%s", x); }
void R() {}
template <class T, class... U>
void R(T &head, U &...tail) {
  _R(head);
  R(tail...);
}
template <class T>
void _W(const T &x) {
  cout << x;
}
void _W(const int &x) { printf("%d", x); }
void _W(const long long &x) { printf("%lld", x); }
void _W(const double &x) { printf("%.16f", x); }
void _W(const char &x) { putchar(x); }
void _W(const char *x) { printf("%s", x); }
template <class T, class U>
void _W(const pair<T, U> &x) {
  _W(x.first);
  putchar(' ');
  _W(x.second);
}
template <class T>
void _W(const vector<T> &x) {
  for (auto i = x.begin(); i != x.end(); _W(*i++))
    if (i != x.cbegin()) putchar(' ');
}
void W() {}
template <class T, class... U>
void W(const T &head, const U &...tail) {
  _W(head);
  putchar(sizeof...(tail) ? ' ' : '\n');
  W(tail...);
}
int MOD = 1e9 + 7;
void ADD(long long &x, long long v) {
  x = (x + v) % MOD;
  if (x < 0) x += MOD;
}
const int SIZE = 1e4 + 10;
struct Data {
  int x, y1, y2;
  Data(int x = 0, int y1 = 0, int y2 = 0) : x(x), y1(y1), y2(y2) {}
  bool operator<(const Data &b) const { return x < b.x; }
} vv[SIZE], hh[SIZE];
int vn, hn;
bool in(int v, int l, int r) { return l <= v && v <= r; }
vector<int> r[SIZE];
struct BIT {
  int _n;
  long long _d[SIZE];
  void init(int __n) {
    _n = __n;
    memset(_d, 0, sizeof(long long) * (_n + 1));
  }
  void ins(int x, long long v) {
    for (; x <= _n; x += x & -x) _d[x] += v;
  }
  long long qq(int x) {
    long long res = 0;
    for (; x; x -= x & -x) res += _d[x];
    return res;
  }
  long long qq_range(int x, int y) {
    long long ret = qq(y);
    if (x) ret -= qq(x - 1);
    return ret;
  }
} bit;
int main() {
  int n;
  R(n);
  for (int i = 0; i < (n); ++i) {
    int x1, y1, x2, y2;
    R(x1, y1, x2, y2);
    x1 += 5001;
    x2 += 5001;
    y1 += 5001;
    y2 += 5001;
    if (x1 == x2) {
      if (y1 > y2) swap(y1, y2);
      vv[vn++] = Data(x1, y1, y2);
    } else {
      if (x1 > x2) swap(x1, x2);
      hh[hn++] = Data(y1, x1, x2);
    }
  }
  sort(vv, vv + vn);
  sort(hh, hh + hn);
  long long an = 0;
  for (int i = (1); i < (vn); ++i) {
    vector<int> AA;
    for (int j = 0; j < (i); ++j) r[j].clear();
    for (int j = 0; j < (hn); ++j) {
      if (in(hh[j].x, vv[i].y1, vv[i].y2) && in(vv[i].x, hh[j].y1, hh[j].y2)) {
        int ll = 0, rr = i;
        while (ll < rr) {
          int mm = (ll + rr) / 2;
          if (vv[mm].x >= hh[j].y1)
            rr = mm;
          else
            ll = mm + 1;
        }
        if (ll != i) r[ll].push_back(hh[j].x);
      }
    }
    bit.init(10003);
    for (int j = 0; j < (i); ++j) {
      for (int y : r[j]) bit.ins(y, 1);
      int v = bit.qq_range(vv[j].y1, vv[j].y2);
      an += v * (v - 1) / 2;
    }
  }
  W(an);
  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;
template <class T>
void _R(T &x) {
  cin >> x;
}
void _R(int &x) { scanf("%d", &x); }
void _R(long long &x) { scanf("%lld", &x); }
void _R(double &x) { scanf("%lf", &x); }
void _R(char &x) { scanf(" %c", &x); }
void _R(char *x) { scanf("%s", x); }
void R() {}
template <class T, class... U>
void R(T &head, U &...tail) {
  _R(head);
  R(tail...);
}
template <class T>
void _W(const T &x) {
  cout << x;
}
void _W(const int &x) { printf("%d", x); }
void _W(const long long &x) { printf("%lld", x); }
void _W(const double &x) { printf("%.16f", x); }
void _W(const char &x) { putchar(x); }
void _W(const char *x) { printf("%s", x); }
template <class T, class U>
void _W(const pair<T, U> &x) {
  _W(x.first);
  putchar(' ');
  _W(x.second);
}
template <class T>
void _W(const vector<T> &x) {
  for (auto i = x.begin(); i != x.end(); _W(*i++))
    if (i != x.cbegin()) putchar(' ');
}
void W() {}
template <class T, class... U>
void W(const T &head, const U &...tail) {
  _W(head);
  putchar(sizeof...(tail) ? ' ' : '\n');
  W(tail...);
}
int MOD = 1e9 + 7;
void ADD(long long &x, long long v) {
  x = (x + v) % MOD;
  if (x < 0) x += MOD;
}
const int SIZE = 1e4 + 10;
struct Data {
  int x, y1, y2;
  Data(int x = 0, int y1 = 0, int y2 = 0) : x(x), y1(y1), y2(y2) {}
  bool operator<(const Data &b) const { return x < b.x; }
} vv[SIZE], hh[SIZE];
int vn, hn;
bool in(int v, int l, int r) { return l <= v && v <= r; }
vector<int> r[SIZE];
struct BIT {
  int _n;
  long long _d[SIZE];
  void init(int __n) {
    _n = __n;
    memset(_d, 0, sizeof(long long) * (_n + 1));
  }
  void ins(int x, long long v) {
    for (; x <= _n; x += x & -x) _d[x] += v;
  }
  long long qq(int x) {
    long long res = 0;
    for (; x; x -= x & -x) res += _d[x];
    return res;
  }
  long long qq_range(int x, int y) {
    long long ret = qq(y);
    if (x) ret -= qq(x - 1);
    return ret;
  }
} bit;
int main() {
  int n;
  R(n);
  for (int i = 0; i < (n); ++i) {
    int x1, y1, x2, y2;
    R(x1, y1, x2, y2);
    x1 += 5001;
    x2 += 5001;
    y1 += 5001;
    y2 += 5001;
    if (x1 == x2) {
      if (y1 > y2) swap(y1, y2);
      vv[vn++] = Data(x1, y1, y2);
    } else {
      if (x1 > x2) swap(x1, x2);
      hh[hn++] = Data(y1, x1, x2);
    }
  }
  sort(vv, vv + vn);
  sort(hh, hh + hn);
  long long an = 0;
  for (int i = (1); i < (vn); ++i) {
    vector<int> AA;
    for (int j = 0; j < (i); ++j) r[j].clear();
    for (int j = 0; j < (hn); ++j) {
      if (in(hh[j].x, vv[i].y1, vv[i].y2) && in(vv[i].x, hh[j].y1, hh[j].y2)) {
        int ll = 0, rr = i;
        while (ll < rr) {
          int mm = (ll + rr) / 2;
          if (vv[mm].x >= hh[j].y1)
            rr = mm;
          else
            ll = mm + 1;
        }
        if (ll != i) r[ll].push_back(hh[j].x);
      }
    }
    bit.init(10003);
    for (int j = 0; j < (i); ++j) {
      for (int y : r[j]) bit.ins(y, 1);
      int v = bit.qq_range(vv[j].y1, vv[j].y2);
      an += v * (v - 1) / 2;
    }
  }
  W(an);
  return 0;
}

```