#include <bits/stdc++.h>
#define int long long
// #define int __int128_t
#define ll long long
#define ull unsigned long long
#define min std::min
#define max std::max
#define swap std::swap

namespace IO
{
	const int N = 1e6 + 5;
	char obuf[N], * p3 = obuf; char ibuf[N], * p1 = ibuf, * p2 = ibuf;
	inline void flush() { fwrite(obuf, p3 - obuf, 1, stdout); p3 = obuf; }
	inline void putch(char x) { (p3 - obuf < N) ? (*p3++ = x) : (flush(), *p3++ = x); }
	inline char getch() { return p1 == p2 && (p2 = (p1 = ibuf) + fread(ibuf, 1, N, stdin), p1 == p2) ? EOF : *p1++; }
	inline bool READ(char& p) { p = getch(); while (p == ' ' || p == '\n' || p == -1) { if (p == -1) return true; p = getch(); } return false; }
	inline bool READ(char* p) { char ch = getch(); while (ch == ' ' || ch == '\n' || ch == -1) { if (ch == -1) return true; ch = getch(); } while (ch != ' ' && ch != '\n' && ch != -1) { *p++ = ch; ch = getch(); } *p++ = '\0'; return ch == -1; }
	inline bool READ(std::string& str) { str = ""; char ch = getch(); while (ch == ' ' || ch == '\n' || ch == -1) { if (ch == -1) return true; ch = getch(); } while (ch != ' ' && ch != '\n' && ch != -1) { str += ch; ch = getch(); } return ch == -1; }
	inline bool READ(signed& x) { register char ch = getch(); while (ch < '0' || ch > '9') { if (ch == -1) return true; if (ch == '-') { if (READ(x)) { x = -x; return true; } x = -x; return false; } ch = getch(); } x = 0; while (ch <= '9' && ch >= '0') { x = (x << 3) + (x << 1) + (ch ^ 48); ch = getch(); } if (ch == -1) return true; return false; } inline bool READ(unsigned& x) { register char ch = getch(); while (ch < '0' || ch > '9') { if (ch == -1) return true; ch = getch(); } x = 0; while (ch <= '9' && ch >= '0') { x = (x << 3) + (x << 1) + (ch ^ 48); ch = getch(); } if (ch == -1) return true; return false; }
	inline bool READ(short& x) { register char ch = getch(); while (ch < '0' || ch > '9') { if (ch == -1) return true; if (ch == '-') { if (READ(x)) { x = -x; return true; } x = -x; return false; } ch = getch(); } x = 0; while (ch <= '9' && ch >= '0') { x = (x << 3) + (x << 1) + (ch ^ 48); ch = getch(); } if (ch == -1) return true; return false; } inline bool READ(unsigned short& x) { register char ch = getch(); while (ch < '0' || ch > '9') { if (ch == -1) return true; ch = getch(); } x = 0; while (ch <= '9' && ch >= '0') { x = (x << 3) + (x << 1) + (ch ^ 48); ch = getch(); } if (ch == -1) return true; return false; }
	inline bool READ(long long& x) { register char ch = getch(); while (ch < '0' || ch > '9') { if (ch == -1) return true; if (ch == '-') { if (READ(x)) { x = -x; return true; } x = -x; return false; } ch = getch(); } x = 0; while (ch <= '9' && ch >= '0') { x = (x << 3) + (x << 1) + (ch ^ 48); ch = getch(); } if (ch == -1) return true; return false; } inline bool READ(unsigned long long& x) { register char ch = getch(); while (ch < '0' || ch > '9') { if (ch == -1) return true; ch = getch(); } x = 0; while (ch <= '9' && ch >= '0') { x = (x << 3) + (x << 1) + (ch ^ 48); ch = getch(); } if (ch == -1) return true; return false; }
	inline bool READ(__int128_t& x) { register char ch = getch(); while (ch < '0' || ch > '9') { if (ch == -1) return true; if (ch == '-') { if (READ(x)) { x = -x; return true; } x = -x; return false; } ch = getch(); } x = 0; while (ch <= '9' && ch >= '0') { x = (x << 3) + (x << 1) + (ch ^ 48); ch = getch(); } if (ch == -1) return true; return false; } inline bool READ(__uint128_t& x) { register char ch = getch(); while (ch < '0' || ch > '9') { if (ch == -1) return true; ch = getch(); } x = 0; while (ch <= '9' && ch >= '0') { x = (x << 3) + (x << 1) + (ch ^ 48); ch = getch(); } if (ch == -1) return true; return false; }
	inline bool read() { return false; }
	template < typename T, typename ... T2 > inline bool read(T& x, T2& ... oth) { if (READ(x)) return true; return read(oth...); }
	inline int Read() { register int x = 0; read(x); return x; }
	inline void WRITE(char ch) { putch(ch); }
	inline void WRITE(char* ch) { register int len = strlen(ch); for (register int i = 0; i < len; i++) putch(ch[i]); }
	inline void WRITE(std::string ch) { register int siz = ch.size(); for (register int i = 0; i < siz; i++) putch(ch[i]); }
	inline void WRITE(signed x) { if (!x) { putch('0'); return; } register int len = 0; register signed k1 = x; register char c[50] = {}; if (k1 < 0) k1 = -k1, putch('-'); while (k1) c[len++] = k1 % 10 ^ 48, k1 /= 10; while (len--) putch(c[len]); }
	inline void WRITE(unsigned x) { if (!x) { putch('0'); return; } register int len = 0; register unsigned k1 = x; register char c[50] = {}; while (k1) c[len++] = k1 % 10 ^ 48, k1 /= 10; while (len--) putch(c[len]); }
	inline void WRITE(short x) { if (!x) { putch('0'); return; } register int len = 0; register short k1 = x; register char c[50] = {}; if (k1 < 0) k1 = -k1, putch('-'); while (k1) c[len++] = k1 % 10 ^ 48, k1 /= 10; while (len--) putch(c[len]); }
	inline void WRITE(unsigned short x) { if (!x) { putch('0'); return; } register int len = 0; register unsigned short k1 = x; register char c[50] = {}; while (k1) c[len++] = k1 % 10 ^ 48, k1 /= 10; while (len--) putch(c[len]); }
	inline void WRITE(long long x) { if (!x) { putch('0'); return; } register int len = 0; register long long k1 = x; register char c[50] = {}; if (k1 < 0) k1 = -k1, putch('-'); while (k1) c[len++] = k1 % 10 ^ 48, k1 /= 10; while (len--) putch(c[len]); }
	inline void WRITE(unsigned long long x) { if (!x) { putch('0'); return; } register int len = 0; register unsigned long long k1 = x; register char c[50] = {}; while (k1) c[len++] = k1 % 10 ^ 48, k1 /= 10; while (len--) putch(c[len]); }
	inline void WRITE(__int128_t x) { if (!x) { putch('0'); return; } register int len = 0; register __int128_t k1 = x; register char c[50] = {}; if (k1 < 0) k1 = -k1, putch('-'); while (k1) c[len++] = k1 % 10 ^ 48, k1 /= 10; while (len--) putch(c[len]); }
	inline void WRITE(__uint128_t x) { if (!x) { putch('0'); return; } register int len = 0; register __uint128_t k1 = x; register char c[50] = {}; while (k1) c[len++] = k1 % 10 ^ 48, k1 /= 10; while (len--) putch(c[len]); }
	inline void write() {  }
	template < typename T, typename ... T2 > inline void write(T x, T2 ... oth) { WRITE(x); write(oth...); }
	template < typename T, typename ... T2 > inline void writef(T x, T2 ... oth) { WRITE(x); write(oth...); flush(); }
} using IO::getch; using IO::READ; using IO::WRITE; using IO::read; using IO::write; using IO::writef; using IO::flush; using IO::putch; using IO::getch; using IO::Read;
using namespace std;

const int N = 6e5 + 5;
int n;
struct Node { int x1, x2, y1, y2; }; Node s[N];
int X[N], Y[N];
int idx1, idx2;
inline ll calc(ll a, ll b, ll c)
{
	return c - b - b - b + a + a;
}
struct SegmentTree
{
	struct Node
	{
		int l, r, add;
		ll sum1, sum2, sum3;
	};
	Node tree[N << 2];
	inline void pushup(int x)
	{
		tree[x].sum1 = tree[x << 1].sum1 + tree[x << 1 | 1].sum1;
		tree[x].sum2 = tree[x << 1].sum2 + tree[x << 1 | 1].sum2;
		tree[x].sum3 = tree[x << 1].sum3 + tree[x << 1 | 1].sum3;
	}
	inline void add_tag(int x, int k)
	{
		tree[x].add += k;
		tree[x].sum3 += 3 * tree[x].sum2 * k + 3 * tree[x].sum1 * k * k + 1ll * k * k * k * (tree[x].r - tree[x].l + 1);
		tree[x].sum2 += 2 * tree[x].sum1 * k + 1ll * k * k * (tree[x].r - tree[x].l + 1);
		tree[x].sum1 += 1ll * k * (tree[x].r - tree[x].l + 1);
	}
	inline void pushdown(int x)
	{
		if (tree[x].add)
		{
			add_tag(x << 1, tree[x].add);
			add_tag(x << 1 | 1, tree[x].add);
			tree[x].add = 0;
		}
	}
	void build(int x)
	{
		tree[x].sum1 = tree[x].sum2 = tree[x].sum3 = tree[x].add = 0;
		if (tree[x].l == tree[x].r) return ;
		tree[x << 1].l = tree[x].l, tree[x << 1].r = tree[x].l + tree[x].r >> 1;
		tree[x << 1 | 1].l = tree[x << 1].r + 1, tree[x << 1 | 1].r = tree[x].r;
		build(x << 1), build(x << 1 | 1);
	}
	void updata(int x, int l, int r, int k)
	{
		if (tree[x].l >= l && tree[x].r <= r) return add_tag(x, k);
		pushdown(x);
		if (l <= tree[x << 1].r) updata(x << 1, l, r, k);
		if (r >= tree[x << 1 | 1].l) updata(x << 1 | 1, l, r, k);
		pushup(x);
	}
	int query(int x, int l, int r)
	{
		if (tree[x].l >= l && tree[x].r <= r) return calc(tree[x].sum1, tree[x].sum2, tree[x].sum3);
		pushdown(x);
		if (l > tree[x << 1].r) return query(x << 1 | 1, l, r);
		if (r < tree[x << 1 | 1].l) return query(x << 1, l, r);
		return query(x << 1, l, r) + query(x << 1 | 1, l, r);
	}
	inline int query() { return calc(tree[1].sum1, tree[1].sum2, tree[1].sum3); }
};
inline int lowbit(int x) { return x & -x; }
struct BIT
{
	int tree[N];
	inline void add(int x, int y) { for (; x <= idx2; x += lowbit(x)) tree[x] += y; }
	inline int sum(int x) { int res = 0; for (; x; x -= lowbit(x)) res += tree[x]; return res; }
};
vector < pair < int, int > > add[6][N];
vector < pair < int, int > > sub[6][N];
vector < int > ADD[N], SUB[N];
SegmentTree st;
BIT bit[2][2];
int d[N];
int ans1, ans2;
inline void ___()
{
	read(n);
	for (int i = 1; i <= n; i++)
	{
		read(s[i].x1, s[i].x2, s[i].y1, s[i].y2);
		X[++idx1] = s[i].x1, X[++idx1] = s[i].x2;
		X[++idx1] = s[i].x2 - 1;
		Y[++idx2] = s[i].y1, Y[++idx2] = s[i].y2;
		Y[++idx2] = s[i].y2 - 1;
	}
	sort(X + 1, X + 1 + idx1), idx1 = unique(X + 1, X + 1 + idx1) - X - 1;
	sort(Y + 1, Y + 1 + idx2), idx2 = unique(Y + 1, Y + 1 + idx2) - Y - 1;
	for (int i = 1; i <= n; i++)
	{
		s[i].x1 = lower_bound(X + 1, X + 1 + idx1, s[i].x1) - X;
		s[i].x2 = lower_bound(X + 1, X + 1 + idx1, s[i].x2) - X;
		s[i].y1 = lower_bound(Y + 1, Y + 1 + idx2, s[i].y1) - Y;
		s[i].y2 = lower_bound(Y + 1, Y + 1 + idx2, s[i].y2) - Y;
		
		add[0][s[i].x1].emplace_back(s[i].y1, s[i].y2);
		sub[0][s[i].x2].emplace_back(s[i].y1, s[i].y2);
		ADD[s[i].x1].emplace_back(i);
		SUB[s[i].x2].emplace_back(i);
		//包含(x, y)
		
		add[1][s[i].x1].emplace_back(s[i].y1, s[i].y2 - 1);
		sub[1][s[i].x2 - 1].emplace_back(s[i].y1, s[i].y2 - 1);
		//包含(x, y), (x + 1, y + 1)
		
		add[2][s[i].x1].emplace_back(s[i].y1, s[i].y2 - 1);
		sub[2][s[i].x2].emplace_back(s[i].y1, s[i].y2 - 1);
		//包含(x, y), (x, y + 1)
		
		add[3][s[i].x1].emplace_back(s[i].y1, s[i].y2);
		sub[3][s[i].x2 - 1].emplace_back(s[i].y1, s[i].y2);
		//包含(x, y), (x + 1, y)
	}
	st.tree[1].l = 1, st.tree[1].r = idx2, st.build(1);
	for (int i = 1; i <= idx1; i++)
	{
		for (int j = add[0][i].size() * 1ll - 1ll; j >= 0; j--) st.updata(1, add[0][i][j].first, add[0][i][j].second, 1);
		ans1 += st.query();
		for (int j = sub[0][i].size() * 1ll - 1ll; j >= 0; j--) st.updata(1, sub[0][i][j].first, sub[0][i][j].second, -1);
		
		for (int j = add[0][i].size() * 1ll - 1ll; j >= 0; j--)
		{
			d[ADD[i][j]] += bit[0][0].sum(add[0][i][j].second) - bit[0][1].sum(add[0][i][j].first - 1);
			d[ADD[i][j]] -= bit[1][0].sum(add[0][i][j].second) - bit[1][1].sum(add[0][i][j].first - 1);
			bit[0][0].add(add[0][i][j].first, 1);
			bit[0][1].add(add[0][i][j].second, 1);
			bit[1][0].add(add[0][i][j].first, 1);
			bit[1][1].add(add[0][i][j].second, 1);
		}
		for (int j = sub[0][i].size() * 1ll - 1ll; j >= 0; j--)
		{
			d[SUB[i][j]] += bit[1][0].sum(sub[0][i][j].second) - bit[1][1].sum(sub[0][i][j].first - 1);
			bit[0][0].add(sub[0][i][j].first, -1);
			bit[0][1].add(sub[0][i][j].second, -1);
		}
	}
	st.tree[1].l = 1, st.tree[1].r = idx2, st.build(1);
	for (int i = 1; i <= idx1; i++)
	{
		for (int j = add[1][i].size() * 1ll - 1ll; j >= 0; j--) st.updata(1, add[1][i][j].first, add[1][i][j].second, 1);
		ans1 += st.query();
		for (int j = sub[1][i].size() * 1ll - 1ll; j >= 0; j--) st.updata(1, sub[1][i][j].first, sub[1][i][j].second, -1);
	}
	st.tree[1].l = 1, st.tree[1].r = idx2, st.build(1);
	for (int i = 1; i <= idx1; i++)
	{
		for (int j = add[2][i].size() * 1ll - 1ll; j >= 0; j--) st.updata(1, add[2][i][j].first, add[2][i][j].second, 1);
		ans1 -= st.query();
		for (int j = sub[2][i].size() * 1ll - 1ll; j >= 0; j--) st.updata(1, sub[2][i][j].first, sub[2][i][j].second, -1);
	}
	st.tree[1].l = 1, st.tree[1].r = idx2, st.build(1);
	for (int i = 1; i <= idx1; i++)
	{
		for (int j = add[3][i].size() * 1ll - 1ll; j >= 0; j--) st.updata(1, add[3][i][j].first, add[3][i][j].second, 1);
		ans1 -= st.query();
		for (int j = sub[3][i].size() * 1ll - 1ll; j >= 0; j--) st.updata(1, sub[3][i][j].first, sub[3][i][j].second, -1);
	}
	ans1 /= 6;
	for (int i = 1; i <= n; i++)
	{
		d[i]--;
		ans2 += d[i] * (n - 1 - d[i]);
	}
	ans2 /= 2;
	write(1ll * n * (n - 1) * (n - 2) / 6 - ans1 - ans2);
}
signed main()
{
	// freopen("rectangle.in", "r", stdin), freopen("rectangle.out", "w", stdout);
	int _ = 1;
	// read(_);
	while (_--) ___();
	flush();
	return ~(0 ^ _ ^ 0);
}