#include <bits/stdc++.h>
using namespace std;
const int maxn = 2e5 + 555;
const int MOD = 1e9 + 7;
long long xpow(long long a, long long b) {
  long long ret = 1;
  while (b) {
    if (b & 1) ret = ret * a % MOD;
    a = a * a % MOD;
    b >>= 1;
  }
  return ret;
}
void OUT(bool res) { cout << (res ? "YES" : "NO") << endl; }
void out(bool res) { cout << (res ? "Yes" : "No") << endl; }
bool between(int a, int b, int c) { return c <= b && c >= a; }
struct node {
  int a1, b1, a2, b2;
  friend bool co(node& x, node& y) {
    if (x.a1 == x.a2 && y.b1 == y.b2) {
      return between(x.b1, x.b2, y.b1) && between(y.a1, y.a2, x.a1);
    } else if (y.a1 == y.a2 && x.b1 == x.b2) {
      return between(y.b1, y.b2, x.b1) && between(x.a1, x.a2, y.a1);
    } else
      assert(false);
  }
};
vector<node> V1;
vector<node> V2;
bitset<5000> st[5000];
int main() {
  int n, a, b, c, d;
  scanf("%d", &n);
  for (int i = 0; i < n; i++) {
    scanf("%d%d%d%d", &a, &b, &c, &d);
    if (a == c) {
      if (b > d) {
        swap(b, d);
      }
    }
    if (b == d) {
      if (a > c) {
        swap(a, c);
      }
    }
    node x = {a, b, c, d};
    if (a == c)
      V1.push_back(x);
    else
      V2.push_back(x);
  }
  if (V1.size() > V2.size()) swap(V1, V2);
  long long ans = 0;
  for (int i = 0; i < (int)V1.size(); i++) {
    for (int j = 0; j < (int)V2.size(); j++) {
      if (co(V1[i], V2[j])) st[i][j] = true;
    }
    for (int j = 0; j < i; j++) {
      long long res = (st[i] & st[j]).count();
      ans += (res) * (res - 1) / 2;
    }
  }
  cout << ans << endl;
  return 0;
}

### 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 maxn = 2e5 + 555;
const int MOD = 1e9 + 7;
long long xpow(long long a, long long b) {
  long long ret = 1;
  while (b) {
    if (b & 1) ret = ret * a % MOD;
    a = a * a % MOD;
    b >>= 1;
  }
  return ret;
}
void OUT(bool res) { cout << (res ? "YES" : "NO") << endl; }
void out(bool res) { cout << (res ? "Yes" : "No") << endl; }
bool between(int a, int b, int c) { return c <= b && c >= a; }
struct node {
  int a1, b1, a2, b2;
  friend bool co(node& x, node& y) {
    if (x.a1 == x.a2 && y.b1 == y.b2) {
      return between(x.b1, x.b2, y.b1) && between(y.a1, y.a2, x.a1);
    } else if (y.a1 == y.a2 && x.b1 == x.b2) {
      return between(y.b1, y.b2, x.b1) && between(x.a1, x.a2, y.a1);
    } else
      assert(false);
  }
};
vector<node> V1;
vector<node> V2;
bitset<5000> st[5000];
int main() {
  int n, a, b, c, d;
  scanf("%d", &n);
  for (int i = 0; i < n; i++) {
    scanf("%d%d%d%d", &a, &b, &c, &d);
    if (a == c) {
      if (b > d) {
        swap(b, d);
      }
    }
    if (b == d) {
      if (a > c) {
        swap(a, c);
      }
    }
    node x = {a, b, c, d};
    if (a == c)
      V1.push_back(x);
    else
      V2.push_back(x);
  }
  if (V1.size() > V2.size()) swap(V1, V2);
  long long ans = 0;
  for (int i = 0; i < (int)V1.size(); i++) {
    for (int j = 0; j < (int)V2.size(); j++) {
      if (co(V1[i], V2[j])) st[i][j] = true;
    }
    for (int j = 0; j < i; j++) {
      long long res = (st[i] & st[j]).count();
      ans += (res) * (res - 1) / 2;
    }
  }
  cout << ans << endl;
  return 0;
}

```