#include <bits/stdc++.h>
using namespace std;
using i64 = long long;
const int maxn = 8e5 + 5;
template <typename T>
void read(T &x) {
	T sgn = 1; char ch = getchar();
	for (; !isdigit(ch); ch = getchar()) if (ch == '-') sgn = -1;
	for (x = 0; isdigit(ch); ch = getchar()) x = x * 10 + ch - '0';
	x *= sgn;
}
struct node{
	int l, r, d, u;
}p[maxn];
int tmp[maxn], m;
int n, deg[maxn];
i64 ans;
vector<int> vec1[maxn], vec2[maxn];
int sn(int x) {
	if (x < 0) return -1;
	return 1;
}
inline i64 C2(i64 x) { return x * (x - 1) / 2; }
inline i64 C3(i64 x) { return x * (x - 1) * (x - 2) / 6; }
struct BIT{
	int c[maxn];
	void clear() { for (int i = 1; i <= m; i++) c[i] = 0; }
	void add(int x, int v) { while (x <= m) c[x] += v, x += x & -x; }
	int ask(int x) { int ret = 0; while (x) ret += c[x], x -= x & -x; return ret; }
}tr1, tr2;
struct SGT{
	i64 val[maxn << 2][4];
	int tag[maxn << 2];
	void pushup(int p) {
		for (int i = 0; i <= 3; i++) {
			val[p][i] = val[p << 1][i] + val[p << 1 | 1][i];
		}
	}
	void pusht(int p, int v) {
		tag[p] += v;
		i64 c2 = 1ll * v * (v - 1) / 2;
		i64 c3 = c2 * (v - 2) / 3; 
		val[p][3] += val[p][2] * v + val[p][1] * c2 + val[p][0] * c3;
		val[p][2] += val[p][1] * v + val[p][0] * c2;
		val[p][1] += val[p][0] * v;
	}
	void pushdown(int p) {
		if (tag[p]) {
			pusht(p << 1, tag[p]);
			pusht(p << 1 | 1, tag[p]);
			tag[p] = 0;
		}
	}
	i64 ask(int p, int l, int r, int x, int y) {
		if (l > y || r < x) return 0;
		if (x <= l && r <= y) return val[p][3];
		int mid = (l + r) >> 1;
		pushdown(p);
		return ask(p << 1, l, mid, x, y) + ask(p << 1 | 1, mid + 1, r, x, y);
	}
	void modify(int p, int l, int r, int x, int y, int v) {
		if (l > y || r < x || x > y) return;
		if (x <= l && r <= y) return pusht(p, v);
		int mid = (l + r) >> 1;
		pushdown(p);
		modify(p << 1, l, mid, x, y, v);
		modify(p << 1 | 1, mid + 1, r, x, y, v);
		pushup(p);
	}
	void build(int p, int l, int r) {
		tag[p] = 0;
		if (l == r) {
			val[p][0] = 1;
			val[p][1] = val[p][2] = val[p][3] = 0;
			return;
		}
		int mid = (l + r) >> 1;
		build(p << 1, l, mid);
		build(p << 1 | 1, mid + 1, r);
		pushup(p);
	}
}TR;
bool cmp(node a, node b) { return a.l < b.l; }
i64 solve(int u, int v) {
	for (int i = 1; i <= n; i++) {
		vec1[p[i].l + u].push_back(i);
		vec2[p[i].r + 1].push_back(i);
	}
	i64 ret = 0;
	TR.build(1, 1, m);
	for (int i = 1; i <= m + 1; i++) {
		for (auto x : vec1[i]) {
			TR.modify(1, 1, m, p[x].d + v, p[x].u, 1);
		}
		for (auto x : vec2[i]) {
			TR.modify(1, 1, m, p[x].d + v, p[x].u, -1);
		}
		ret += TR.val[1][3];
//		for (int j = 0; j <= 3; j++) {
//			printf("%lld ", TR.val[1][j]);
//		} puts("");
		vec1[i].clear();
		vec2[i].clear();
	}
	return ret;
}
int main() {
	read(n);
	for (int i = 1; i <= n; i++) {
		read(p[i].l); read(p[i].r); read(p[i].d); read(p[i].u);
		tmp[++m] = p[i].l;
		tmp[++m] = p[i].r;
		tmp[++m] = p[i].d;
		tmp[++m] = p[i].u;
	}
	sort(tmp + 1, tmp + m + 1);
	m = unique(tmp + 1, tmp + m + 1) - tmp - 1;
	for (int i = 1; i <= n; i++) {
		p[i].l = lower_bound(tmp + 1, tmp + m + 1, p[i].l) - tmp;
		p[i].r = lower_bound(tmp + 1, tmp + m + 1, p[i].r) - tmp;
		p[i].d = lower_bound(tmp + 1, tmp + m + 1, p[i].d) - tmp;
		p[i].u = lower_bound(tmp + 1, tmp + m + 1, p[i].u) - tmp;
	}
//	for (int i = 1; i <= n; i++) {
//		printf("%d %d %d %d\n", p[i].l, p[i].r, p[i].d, p[i].u);
//	}
	ans = C3(n);
	for (int i = 1; i <= n; i++) {
		vec1[p[i].l].push_back(i);
		vec2[p[i].r].push_back(i);
	}
	for (int i = 1, now = 0; i <= m; i++) {
		for (auto x : vec1[i]) {
			deg[x] -= now - tr1.ask(p[x].d - 1) - (tr2.ask(m) - tr2.ask(p[x].u));
		}
		for (auto x : vec2[i]) {
			now++;
			tr1.add(p[x].u, 1);
			tr2.add(p[x].d, 1);
		}
	}
	for (int i = 1; i <= n; i++) deg[i] += n - tr1.ask(p[i].d - 1) - (tr2.ask(m) - tr2.ask(p[i].u));
	tr1.clear(); tr2.clear();
	for (int i = m, now = 0; i; i--) {
		for (auto x : vec2[i]) {
			deg[x] -= now - tr1.ask(p[x].d - 1) - (tr2.ask(m) - tr2.ask(p[x].u));
		}
		for (auto x : vec1[i]) {
			now++;
			tr1.add(p[x].u, 1);
			tr2.add(p[x].d, 1);
		}
	}
	i64 tot = 0;
	for (int i = 1; i <= n; i++) {
		deg[i]--;
		tot += deg[i];
	}
	tot >>= 1;
	ans -= tot * (n - 2);
	for (int i = 1; i <= n; i++) {
		ans += C2(deg[i]);
	}
//	cerr << ans << "\n";
	for (int i = 1; i <= m + 1; i++) vec1[i].clear(), vec2[i].clear();
	for (int i = 1; i <= n; i++) p[i].r--, p[i].u--;
//	printf("%lld\n", solve(0, 0));
	ans -= solve(0, 0) - solve(1, 0) - solve(0, 1) + solve(1, 1);
	printf("%lld\n", ans);
	return 0;
}
/*
你玩原神吗？ 
*/