#include <bits/stdc++.h>
using namespace std;
struct node {
  bool dir;
  int comp;
  int begin;
  int end;
  node(bool d, int c, int b, int e) {
    dir = d;
    comp = c;
    begin = b;
    end = e;
  }
};
struct segTreeSum {
  vector<int> tree;
  int len;
  segTreeSum(int l) {
    tree = vector<int>(2 * (int)pow(2, ceil(log2(l))));
    len = l;
  }
  void reset(const vector<int>& input) { constructTree(input, 0, len - 1, 0); };
  void constructTree(const vector<int>& input, int low, int high, int pos) {
    if (low == high) {
      tree[pos] = input[low];
      return;
    }
    int mid = (low + high) / 2;
    constructTree(input, low, mid, pos * 2 + 1);
    constructTree(input, mid + 1, high, pos * 2 + 2);
    tree[pos] = tree[pos * 2 + 2] + tree[pos * 2 + 1];
  }
  int query(int low, int high) { return rangeSum(low, high, 0, len - 1, 0); }
  int rangeSum(int qlow, int qhigh, int low, int high, int pos) {
    if (qlow <= low && qhigh >= high) {
      return tree[pos];
    }
    if (qlow > high || low > qhigh) {
      return 0;
    }
    int mid = (low + high) / 2;
    return rangeSum(qlow, qhigh, low, mid, pos * 2 + 1) +
           rangeSum(qlow, qhigh, mid + 1, high, pos * 2 + 2);
  }
  void update(int pos, int diff) { update(pos, diff, 0, len - 1, 0); }
  void update(int i, int diff, int low, int high, int pos) {
    if (i > high || low > i) {
      return;
    }
    tree[pos] += diff;
    if (low != high) {
      int mid = (low + high) / 2;
      update(i, diff, low, mid, pos * 2 + 1);
      update(i, diff, mid + 1, high, pos * 2 + 2);
    }
  }
};
int comp(const node& a, const node& b) {
  if (a.comp < b.comp) {
    return 1;
  }
  if (b.comp < a.comp) {
    return 0;
  }
  return (!a.dir && b.dir);
}
int compH(const pair<int, pair<int, int>>& a,
          const pair<int, pair<int, int>>& b) {
  return a.first < b.first;
}
int compV(const pair<int, pair<int, int>>& a,
          const pair<int, pair<int, int>>& b) {
  return a.second.first < b.second.first;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  int n;
  cin >> n;
  vector<pair<int, pair<int, int>>> horiz;
  vector<pair<int, pair<int, int>>> vert;
  vector<node> sweep;
  vector<int> input(10001, 0);
  for (int i = 0; i < n; i++) {
    int x1, x2, y1, y2;
    cin >> x1 >> y1 >> x2 >> y2;
    x1 += 5000;
    y1 += 5000;
    x2 += 5000;
    y2 += 5000;
    if (x1 > x2) {
      swap(x1, x2);
    }
    if (y1 > y2) {
      swap(y1, y2);
    }
    if (x1 == x2) {
      sweep.emplace_back(true, y2, x1, y1);
      vert.emplace_back(x1, make_pair(y1, y2));
    } else {
      sweep.emplace_back(false, y1, x1, x2);
    }
  }
  int counter = 0;
  int hcount = 0;
  int vcount = 0;
  long long ans = 0;
  sort(sweep.begin(), sweep.end(), comp);
  sort(vert.begin(), vert.end(), compV);
  for (auto i : sweep) {
    if (!i.dir) {
      horiz.emplace_back(i.comp, make_pair(i.begin, i.end));
    }
  }
  segTreeSum st(10001);
  if (horiz.size() == 0) {
    cout << "0"
         << "\n";
    return 0;
  }
  while (hcount < horiz.size() - 1) {
    fill(input.begin(), input.end(), 0);
    vcount = 0;
    while (vcount < vert.size() &&
           vert[vcount].second.first <= horiz[hcount].first) {
      if (vert[vcount].second.second >= horiz[hcount].first &&
          vert[vcount].first <= horiz[hcount].second.second &&
          vert[vcount].first >= horiz[hcount].second.first) {
        input[vert[vcount].first] = 1;
      }
      vcount++;
    }
    st.reset(input);
    while (sweep[counter].dir) {
      counter++;
    }
    counter++;
    int count = counter;
    while (count < sweep.size()) {
      if (sweep[count].dir) {
        if (input[sweep[count].begin] == 1) {
          input[sweep[count].begin] = 0;
          st.update(sweep[count].begin, -1);
        }
      } else {
        long long add = st.query(sweep[count].begin, sweep[count].end);
        ans += (add * (add - 1)) / 2;
      }
      count++;
    }
    hcount++;
  }
  cout << ans << "\n";
}

### Prompt

Please create a solution in cpp 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;
struct node {
  bool dir;
  int comp;
  int begin;
  int end;
  node(bool d, int c, int b, int e) {
    dir = d;
    comp = c;
    begin = b;
    end = e;
  }
};
struct segTreeSum {
  vector<int> tree;
  int len;
  segTreeSum(int l) {
    tree = vector<int>(2 * (int)pow(2, ceil(log2(l))));
    len = l;
  }
  void reset(const vector<int>& input) { constructTree(input, 0, len - 1, 0); };
  void constructTree(const vector<int>& input, int low, int high, int pos) {
    if (low == high) {
      tree[pos] = input[low];
      return;
    }
    int mid = (low + high) / 2;
    constructTree(input, low, mid, pos * 2 + 1);
    constructTree(input, mid + 1, high, pos * 2 + 2);
    tree[pos] = tree[pos * 2 + 2] + tree[pos * 2 + 1];
  }
  int query(int low, int high) { return rangeSum(low, high, 0, len - 1, 0); }
  int rangeSum(int qlow, int qhigh, int low, int high, int pos) {
    if (qlow <= low && qhigh >= high) {
      return tree[pos];
    }
    if (qlow > high || low > qhigh) {
      return 0;
    }
    int mid = (low + high) / 2;
    return rangeSum(qlow, qhigh, low, mid, pos * 2 + 1) +
           rangeSum(qlow, qhigh, mid + 1, high, pos * 2 + 2);
  }
  void update(int pos, int diff) { update(pos, diff, 0, len - 1, 0); }
  void update(int i, int diff, int low, int high, int pos) {
    if (i > high || low > i) {
      return;
    }
    tree[pos] += diff;
    if (low != high) {
      int mid = (low + high) / 2;
      update(i, diff, low, mid, pos * 2 + 1);
      update(i, diff, mid + 1, high, pos * 2 + 2);
    }
  }
};
int comp(const node& a, const node& b) {
  if (a.comp < b.comp) {
    return 1;
  }
  if (b.comp < a.comp) {
    return 0;
  }
  return (!a.dir && b.dir);
}
int compH(const pair<int, pair<int, int>>& a,
          const pair<int, pair<int, int>>& b) {
  return a.first < b.first;
}
int compV(const pair<int, pair<int, int>>& a,
          const pair<int, pair<int, int>>& b) {
  return a.second.first < b.second.first;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  int n;
  cin >> n;
  vector<pair<int, pair<int, int>>> horiz;
  vector<pair<int, pair<int, int>>> vert;
  vector<node> sweep;
  vector<int> input(10001, 0);
  for (int i = 0; i < n; i++) {
    int x1, x2, y1, y2;
    cin >> x1 >> y1 >> x2 >> y2;
    x1 += 5000;
    y1 += 5000;
    x2 += 5000;
    y2 += 5000;
    if (x1 > x2) {
      swap(x1, x2);
    }
    if (y1 > y2) {
      swap(y1, y2);
    }
    if (x1 == x2) {
      sweep.emplace_back(true, y2, x1, y1);
      vert.emplace_back(x1, make_pair(y1, y2));
    } else {
      sweep.emplace_back(false, y1, x1, x2);
    }
  }
  int counter = 0;
  int hcount = 0;
  int vcount = 0;
  long long ans = 0;
  sort(sweep.begin(), sweep.end(), comp);
  sort(vert.begin(), vert.end(), compV);
  for (auto i : sweep) {
    if (!i.dir) {
      horiz.emplace_back(i.comp, make_pair(i.begin, i.end));
    }
  }
  segTreeSum st(10001);
  if (horiz.size() == 0) {
    cout << "0"
         << "\n";
    return 0;
  }
  while (hcount < horiz.size() - 1) {
    fill(input.begin(), input.end(), 0);
    vcount = 0;
    while (vcount < vert.size() &&
           vert[vcount].second.first <= horiz[hcount].first) {
      if (vert[vcount].second.second >= horiz[hcount].first &&
          vert[vcount].first <= horiz[hcount].second.second &&
          vert[vcount].first >= horiz[hcount].second.first) {
        input[vert[vcount].first] = 1;
      }
      vcount++;
    }
    st.reset(input);
    while (sweep[counter].dir) {
      counter++;
    }
    counter++;
    int count = counter;
    while (count < sweep.size()) {
      if (sweep[count].dir) {
        if (input[sweep[count].begin] == 1) {
          input[sweep[count].begin] = 0;
          st.update(sweep[count].begin, -1);
        }
      } else {
        long long add = st.query(sweep[count].begin, sweep[count].end);
        ans += (add * (add - 1)) / 2;
      }
      count++;
    }
    hcount++;
  }
  cout << ans << "\n";
}

```