#include <bits/stdc++.h>
using namespace std;
const int SZ = 1e6 + 10;
const int INF = 1e9 + 10;
const int mod = 998244353;
const long double eps = 1e-8;
long long read() {
  long long n = 0;
  char a = getchar();
  bool flag = 0;
  while (a > '9' || a < '0') {
    if (a == '-') flag = 1;
    a = getchar();
  }
  while (a <= '9' && a >= '0') {
    n = n * 10 + a - '0', a = getchar();
  }
  if (flag) n = -n;
  return n;
}
struct haha {
  int p, l, r;
};
bool cmpp(haha a, haha b) { return a.p < b.p; }
bool cmpl(haha a, haha b) { return a.l < b.l; }
bool cmpr(haha a, haha b) { return a.r < b.r; }
vector<haha> V, H;
int tree[SZ];
void add(int x, int d) {
  x += 5001;
  for (int i = x; i <= 10001; i += i & -i) tree[i] += d;
}
int ask(int x) {
  x += 5001;
  int ans = 0;
  for (int i = x; i > 0; i -= i & -i) ans += tree[i];
  return ans;
}
int ask(int l, int r) { return ask(r) - ask(l - 1); }
int main() {
  int n = read();
  for (int i = 1; i <= n; i++) {
    int x1 = read(), y1 = read(), x2 = read(), y2 = read();
    if (x1 > x2) swap(x1, x2);
    if (y1 > y2) swap(y1, y2);
    if (x1 == x2)
      V.push_back((haha){x1, y1, y2});
    else
      H.push_back((haha){y1, x1, x2});
  }
  sort(H.begin(), H.end(), cmpp);
  sort(V.begin(), V.end(), cmpr);
  long long ans = 0;
  for (int i = 0; i < H.size(); i++) {
    for (int j = 0; j < V.size(); j++)
      if (V[j].l <= H[i].p) add(V[j].p, 1);
    int k = 0;
    for (int j = i + 1; j < H.size(); j++) {
      while (k < V.size()) {
        if (V[k].l > H[i].p)
          k++;
        else {
          if (V[k].r < H[j].p)
            add(V[k].p, -1), k++;
          else
            break;
        }
      }
      int l = max(H[i].l, H[j].l);
      int r = min(H[i].r, H[j].r);
      if (l > r) continue;
      long long tmp = ask(l, r);
      ans += tmp * (tmp - 1) / 2;
    }
    while (k < V.size()) {
      if (V[k].l > H[i].p)
        k++;
      else {
        add(V[k].p, -1), k++;
      }
    }
  }
  cout << ans << endl;
}

### Prompt

Generate 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;
const int SZ = 1e6 + 10;
const int INF = 1e9 + 10;
const int mod = 998244353;
const long double eps = 1e-8;
long long read() {
  long long n = 0;
  char a = getchar();
  bool flag = 0;
  while (a > '9' || a < '0') {
    if (a == '-') flag = 1;
    a = getchar();
  }
  while (a <= '9' && a >= '0') {
    n = n * 10 + a - '0', a = getchar();
  }
  if (flag) n = -n;
  return n;
}
struct haha {
  int p, l, r;
};
bool cmpp(haha a, haha b) { return a.p < b.p; }
bool cmpl(haha a, haha b) { return a.l < b.l; }
bool cmpr(haha a, haha b) { return a.r < b.r; }
vector<haha> V, H;
int tree[SZ];
void add(int x, int d) {
  x += 5001;
  for (int i = x; i <= 10001; i += i & -i) tree[i] += d;
}
int ask(int x) {
  x += 5001;
  int ans = 0;
  for (int i = x; i > 0; i -= i & -i) ans += tree[i];
  return ans;
}
int ask(int l, int r) { return ask(r) - ask(l - 1); }
int main() {
  int n = read();
  for (int i = 1; i <= n; i++) {
    int x1 = read(), y1 = read(), x2 = read(), y2 = read();
    if (x1 > x2) swap(x1, x2);
    if (y1 > y2) swap(y1, y2);
    if (x1 == x2)
      V.push_back((haha){x1, y1, y2});
    else
      H.push_back((haha){y1, x1, x2});
  }
  sort(H.begin(), H.end(), cmpp);
  sort(V.begin(), V.end(), cmpr);
  long long ans = 0;
  for (int i = 0; i < H.size(); i++) {
    for (int j = 0; j < V.size(); j++)
      if (V[j].l <= H[i].p) add(V[j].p, 1);
    int k = 0;
    for (int j = i + 1; j < H.size(); j++) {
      while (k < V.size()) {
        if (V[k].l > H[i].p)
          k++;
        else {
          if (V[k].r < H[j].p)
            add(V[k].p, -1), k++;
          else
            break;
        }
      }
      int l = max(H[i].l, H[j].l);
      int r = min(H[i].r, H[j].r);
      if (l > r) continue;
      long long tmp = ask(l, r);
      ans += tmp * (tmp - 1) / 2;
    }
    while (k < V.size()) {
      if (V[k].l > H[i].p)
        k++;
      else {
        add(V[k].p, -1), k++;
      }
    }
  }
  cout << ans << endl;
}

```