#include <bits/stdc++.h>

using namespace std;

const int BUFF_SIZE = 1 << 20;
char BUFF[BUFF_SIZE], *BB, *BE;
char gc() { return BB == BE ? (BE = (BB = BUFF) + fread(BUFF, 1, BUFF_SIZE, stdin), BB == BE ? EOF : *BB++) : *BB++; }
void read() {}
template<class T, class ...Ts>
void read(T &x, Ts &...args) {
  x = 0; char ch = 0, w = 0;
  while (ch < '0' || ch > '9') w |= ch == '-', ch = gc();
  while (ch >= '0' && ch <= '9') x = x * 10 + (ch ^ '0'), ch = gc();
  if (w) x = -x;
  read(args...);
}

using ll = long long;
using ull = unsigned long long;

const int N = 2e5;
const int V = 4e5;

int n, vx, vy;
int l[N + 5], r[N + 5], d[N + 5], u[N + 5];
vector<int> uniqx, uniqy;
int cntl[V + 5], cntr[V + 5], cntd[V + 5], cntu[V + 5];
vector<int> atl[V + 5], atr[V + 5], atd[V + 5], atu[V + 5];
struct BinaryIndexedTree {
  int c[V + 5];
  void clear() { fill_n(c + 1, vy, 0); }
  void update(int x, int k) {
    for (; x <= vy; x += x & -x) c[x] += k;
  }
  int query(int x) {
    int ret = 0;
    for (; x; x &= x - 1) ret += c[x];
    return ret;
  }
} bit0, bit1;

int deg[N + 5];
ull ans;

struct SegmentTree {
  static const int H = 19;
  static const int S = 1 << H;
  ull sum[S << 1][4];
  int tag[S << 1];
  void pushUp(int u) {
    for (int i = 0; i <= 3; ++i) sum[u][i] = sum[u << 1][i] + sum[u << 1 | 1][i];
  }
  void apply(int k, int u) {
    tag[u] += k;
    ull c[3] = {(ull)k, (ull)((ll)k * (k - 1) / 2), (ull)((ll)k * (k - 1) * (k - 2) / 6)};
    for (int i = 3; i; --i)
      for (int j = 1; j <= i; ++j)
        sum[u][i] += sum[u][i - j] * c[j - 1];
  }
  void pushDown(int u) {
    if (tag[u])
      apply(tag[u], u << 1), apply(tag[u], u << 1 | 1), tag[u] = 0;
  }
  void topDown(int u) { for (int i = H; i; --i) pushDown(u >> i); }
  void build(int n) {
    for (int i = 1; i <= n; ++i) sum[S + i][0] = 1;
    for (int u = S - 1; u; --u) pushUp(u);
  }
  void update(int l, int r, int k) {
    for (topDown(l += S - 1), topDown(r += S + 1); l ^ r ^ 1; l >>= 1, r >>= 1) {
      if (~l & 1) apply(k, l ^ 1);
      if (r & 1) apply(k, r ^ 1);
      pushUp(l >> 1), pushUp(r >> 1);
    }
    for (l >>= 1; l; l >>= 1) pushUp(l);
  }
} seg0, seg1;

int main() {
  /*freopen("rect.in", "r", stdin), freopen("rect.out", "w", stdout);
  int tmp; read(n, tmp);*/
  read(n);
  for (int i = 1; i <= n; ++i)
    read(l[i], r[i], d[i], u[i]),
    uniqx.push_back(l[i]), uniqx.push_back(r[i]),
    uniqy.push_back(d[i]), uniqy.push_back(u[i]);
  sort(uniqx.begin(), uniqx.end()), uniqx.erase(unique(uniqx.begin(), uniqx.end()), uniqx.end()), vx = uniqx.size(),
  sort(uniqy.begin(), uniqy.end()), uniqy.erase(unique(uniqy.begin(), uniqy.end()), uniqy.end()), vy = uniqx.size();
  for (int i = 1; i <= n; ++i)
    ++cntl[l[i] = lower_bound(uniqx.begin(), uniqx.end(), l[i]) - uniqx.begin() + 1],
    ++cntr[r[i] = lower_bound(uniqx.begin(), uniqx.end(), r[i]) - uniqx.begin() + 1],
    ++cntd[d[i] = lower_bound(uniqy.begin(), uniqy.end(), d[i]) - uniqy.begin() + 1],
    ++cntu[u[i] = lower_bound(uniqy.begin(), uniqy.end(), u[i]) - uniqy.begin() + 1],
    atl[l[i]].push_back(i), atr[r[i]].push_back(i), atd[d[i]].push_back(i), atu[u[i]].push_back(i);
  for (int i = vx; i; --i) cntl[i] += cntl[i + 1];
  for (int i = 1; i <= vx; ++i) cntr[i] += cntr[i - 1];
  for (int i = vy; i; --i) cntd[i] += cntd[i + 1];
  for (int i = 1; i <= vy; ++i) cntu[i] += cntu[i - 1];
  for (int i = 1; i <= n; ++i)
    deg[i] = n - 1 - cntr[l[i] - 1] - cntl[r[i] + 1] - cntu[d[i] - 1] - cntd[u[i] + 1];
  for (int i = 1; i <= vx; ++i) {
    for (int j : atl[i]) deg[j] += bit0.query(d[j] - 1) + bit1.query(vy - u[j]);
    for (int j : atr[i]) bit0.update(u[j], 1), bit1.update(vy - d[j] + 1, 1);
  }
  bit0.clear(), bit1.clear();
  for (int i = vx; i; --i) {
    for (int j : atr[i]) deg[j] += bit0.query(d[j] - 1) + bit1.query(vy - u[j]);
    for (int j : atl[i]) bit0.update(u[j], 1), bit1.update(vy - d[j] + 1, 1);
  }
  ans = (ull)n * (n - 1) * (n - 2) / 3;
  for (int i = 1; i <= n; ++i) ans -= (ull)deg[i] * (n - 1 - deg[i]);
  ans >>= 1, seg0.build(vy), seg1.build(vy);
  for (int i = 1; i <= vx; ++i) {
    for (int j : atl[i])
      seg0.update(d[j], u[j], 1),
      seg1.update(d[j], u[j] - 1, 1);
    ans -= seg0.sum[1][3] - seg1.sum[1][3];
    for (int j : atr[i])
      seg0.update(d[j], u[j], -1),
      seg1.update(d[j], u[j] - 1, -1);
    ans += seg0.sum[1][3] - seg1.sum[1][3];
  }
  printf("%llu\n", ans);
}