#include <bits/stdc++.h>
using namespace std;
void __print(int x) { cerr << x; }
void __print(long x) { cerr << x; }
void __print(long long x) { cerr << x; }
void __print(unsigned x) { cerr << x; }
void __print(unsigned long x) { cerr << x; }
void __print(unsigned long long x) { cerr << x; }
void __print(float x) { cerr << x; }
void __print(double x) { cerr << x; }
void __print(long double x) { cerr << x; }
void __print(char x) { cerr << '\'' << x << '\''; }
void __print(const char *x) { cerr << '\"' << x << '\"'; }
void __print(const string &x) { cerr << '\"' << x << '\"'; }
void __print(bool x) { cerr << (x ? "true" : "false"); }
template <typename T, typename V>
void __print(const pair<T, V> &x) {
  cerr << '{';
  __print(x.first);
  cerr << ',';
  __print(x.second);
  cerr << '}';
}
template <typename T>
void __print(const T &x) {
  int f = 0;
  cerr << '{';
  for (auto &i : x) cerr << (f++ ? "," : ""), __print(i);
  cerr << "}";
}
void _print() { cerr << "]\n"; }
template <typename T, typename... V>
void _print(T t, V... v) {
  __print(t);
  if (sizeof...(v)) cerr << ", ";
  _print(v...);
}
struct custom_hash {
  static uint64_t splitmix64(uint64_t x) {
    x += 0x9e3779b97f4a7c15;
    x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
    x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
    return x ^ (x >> 31);
  }
  size_t operator()(uint64_t x) const {
    static const uint64_t FIXED_RANDOM =
        chrono::steady_clock::now().time_since_epoch().count();
    return splitmix64(x + FIXED_RANDOM);
  }
};
int power(long long x, long long n, const long long P) {
  if (x == 0) return 0;
  if (n == 0 || x == 1) return 1LL;
  x %= P;
  int res = 1;
  while (n > 0) {
    if (n & 1) res = (long long int)res * x % P;
    x = (long long int)x * x % P;
    n /= 2;
  }
  return res;
}
long long int power(long long int x, long long int n) {
  if (x == 0)
    return 0;
  else if (n == 0 || x == 1)
    return 1;
  long long res = 1;
  while (n > 0) {
    if (n & 1) res *= x;
    x *= x;
    n /= 2;
  }
  return res;
}
int inv(long long x) { return power(x, 1000000007 - 2, 1000000007); }
long long int gcd(const long long int a, const long long int b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
long long int lcm(const long long int a, const long long int b) {
  return (a * b) / gcd(a, b);
}
pair<int, int> dx[4] = {make_pair(-1, 0), make_pair(1, 0), make_pair(0, -1),
                        make_pair(0, 1)};
class Fenwick {
 private:
  vector<int> bit;
  int sz;
  int sum(int id) {
    int ans = 0;
    while (id > 0) ans += bit[id], id -= id & -id;
    return ans;
  }

 public:
  Fenwick(int n) {
    sz = n;
    bit.assign(n + 2, 0);
  }
  void update(int id, int val) {
    while (id <= sz) bit[id] += val, id += id & -id;
  }
  int query(int l, int r) { return sum(r) - sum(l - 1); }
  int find(int k) {
    int pos = 0, pre = 0;
    for (int i = log2(sz); i >= 0; i--) {
      if (pos + (1 << i) <= sz && pre + bit[pos + (1 << i)] < k) {
        pos += (1 << i);
        pre += bit[pos];
      }
    }
    return pos;
  }
};
const int off = 5001, N = 10002;
vector<pair<int, int>> vs[N], hs[N];
vector<int> open[N];
void __sol() {
  int n;
  cin >> n;
  for (int i = 0; i < n; i++) {
    int x1, x2, y1, y2;
    cin >> x1 >> y1 >> x2 >> y2;
    x1 += off, x2 += off, y1 += off, y2 += off;
    if (x1 == x2)
      vs[x1].emplace_back(min(y1, y2), max(y1, y2));
    else
      hs[y1].emplace_back(min(x1, x2), max(x1, x2));
  }
  long long ans = 0;
  for (int fix_y = 1; fix_y < N; fix_y++) {
    for (auto &p : hs[fix_y]) {
      Fenwick f(N);
      int l = p.first, r = p.second;
      for (int x = l; x <= r; x++) {
        for (auto &y : vs[x]) {
          if (y.first <= fix_y && y.second > fix_y) {
            open[y.second].emplace_back(x);
            f.update(x, 1);
          }
        }
      }
      for (int y = fix_y + 1; y < N; y++) {
        for (auto &p : hs[y]) {
          int curr = f.query(p.first, p.second);
          ans += curr * (curr - 1) / 2;
        }
        for (auto &x : open[y]) f.update(x, -1);
        open[y].clear();
      }
    }
  }
  cout << ans << "\n";
  return;
}
int main() {
  clock_t time_req = clock();
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  long long int tc = 1;
  while (tc--) __sol();
  time_req = clock() - time_req;
  cerr << "Finished in: " << (float)time_req / CLOCKS_PER_SEC << " seconds"
       << endl;
  return 0;
}

### Prompt

Your task is to create 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;
void __print(int x) { cerr << x; }
void __print(long x) { cerr << x; }
void __print(long long x) { cerr << x; }
void __print(unsigned x) { cerr << x; }
void __print(unsigned long x) { cerr << x; }
void __print(unsigned long long x) { cerr << x; }
void __print(float x) { cerr << x; }
void __print(double x) { cerr << x; }
void __print(long double x) { cerr << x; }
void __print(char x) { cerr << '\'' << x << '\''; }
void __print(const char *x) { cerr << '\"' << x << '\"'; }
void __print(const string &x) { cerr << '\"' << x << '\"'; }
void __print(bool x) { cerr << (x ? "true" : "false"); }
template <typename T, typename V>
void __print(const pair<T, V> &x) {
  cerr << '{';
  __print(x.first);
  cerr << ',';
  __print(x.second);
  cerr << '}';
}
template <typename T>
void __print(const T &x) {
  int f = 0;
  cerr << '{';
  for (auto &i : x) cerr << (f++ ? "," : ""), __print(i);
  cerr << "}";
}
void _print() { cerr << "]\n"; }
template <typename T, typename... V>
void _print(T t, V... v) {
  __print(t);
  if (sizeof...(v)) cerr << ", ";
  _print(v...);
}
struct custom_hash {
  static uint64_t splitmix64(uint64_t x) {
    x += 0x9e3779b97f4a7c15;
    x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
    x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
    return x ^ (x >> 31);
  }
  size_t operator()(uint64_t x) const {
    static const uint64_t FIXED_RANDOM =
        chrono::steady_clock::now().time_since_epoch().count();
    return splitmix64(x + FIXED_RANDOM);
  }
};
int power(long long x, long long n, const long long P) {
  if (x == 0) return 0;
  if (n == 0 || x == 1) return 1LL;
  x %= P;
  int res = 1;
  while (n > 0) {
    if (n & 1) res = (long long int)res * x % P;
    x = (long long int)x * x % P;
    n /= 2;
  }
  return res;
}
long long int power(long long int x, long long int n) {
  if (x == 0)
    return 0;
  else if (n == 0 || x == 1)
    return 1;
  long long res = 1;
  while (n > 0) {
    if (n & 1) res *= x;
    x *= x;
    n /= 2;
  }
  return res;
}
int inv(long long x) { return power(x, 1000000007 - 2, 1000000007); }
long long int gcd(const long long int a, const long long int b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
long long int lcm(const long long int a, const long long int b) {
  return (a * b) / gcd(a, b);
}
pair<int, int> dx[4] = {make_pair(-1, 0), make_pair(1, 0), make_pair(0, -1),
                        make_pair(0, 1)};
class Fenwick {
 private:
  vector<int> bit;
  int sz;
  int sum(int id) {
    int ans = 0;
    while (id > 0) ans += bit[id], id -= id & -id;
    return ans;
  }

 public:
  Fenwick(int n) {
    sz = n;
    bit.assign(n + 2, 0);
  }
  void update(int id, int val) {
    while (id <= sz) bit[id] += val, id += id & -id;
  }
  int query(int l, int r) { return sum(r) - sum(l - 1); }
  int find(int k) {
    int pos = 0, pre = 0;
    for (int i = log2(sz); i >= 0; i--) {
      if (pos + (1 << i) <= sz && pre + bit[pos + (1 << i)] < k) {
        pos += (1 << i);
        pre += bit[pos];
      }
    }
    return pos;
  }
};
const int off = 5001, N = 10002;
vector<pair<int, int>> vs[N], hs[N];
vector<int> open[N];
void __sol() {
  int n;
  cin >> n;
  for (int i = 0; i < n; i++) {
    int x1, x2, y1, y2;
    cin >> x1 >> y1 >> x2 >> y2;
    x1 += off, x2 += off, y1 += off, y2 += off;
    if (x1 == x2)
      vs[x1].emplace_back(min(y1, y2), max(y1, y2));
    else
      hs[y1].emplace_back(min(x1, x2), max(x1, x2));
  }
  long long ans = 0;
  for (int fix_y = 1; fix_y < N; fix_y++) {
    for (auto &p : hs[fix_y]) {
      Fenwick f(N);
      int l = p.first, r = p.second;
      for (int x = l; x <= r; x++) {
        for (auto &y : vs[x]) {
          if (y.first <= fix_y && y.second > fix_y) {
            open[y.second].emplace_back(x);
            f.update(x, 1);
          }
        }
      }
      for (int y = fix_y + 1; y < N; y++) {
        for (auto &p : hs[y]) {
          int curr = f.query(p.first, p.second);
          ans += curr * (curr - 1) / 2;
        }
        for (auto &x : open[y]) f.update(x, -1);
        open[y].clear();
      }
    }
  }
  cout << ans << "\n";
  return;
}
int main() {
  clock_t time_req = clock();
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  long long int tc = 1;
  while (tc--) __sol();
  time_req = clock() - time_req;
  cerr << "Finished in: " << (float)time_req / CLOCKS_PER_SEC << " seconds"
       << endl;
  return 0;
}

```