# include <bits/stdc++.h>
using namespace std;
// typedef long long ll;
typedef unsigned long long ull;
// # define int long long
#define int __int128_t
#define ll __int128_t
# define lc u << 1
# define rc u << 1 | 1
# define fi first
# define se second
const int N = 4e5 + 5;

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;

int n;
struct node
{
	int x1, x2, y1, y2;
	bool operator < (const node &t) const { return y1 < t.y1; }
} a[N];
int tmp[N * 2], tot;
ll deg[N];
struct xian
{
	int x, y1, y2, id, flag;
} line[N * 2];
int lowbit (int x) { return x & (-x); }
struct BIT
{
	int c[N * 2];
	void modify (int x, ll w) { for (; x < N; x += lowbit (x)) c[x] += w; }
	ll query (int x) { int s = 0; for (; x; x -= lowbit (x)) s += c[x]; return s; }
} shangy1, shangy2, xiay1, xiay2, xjy1, xjy2;
struct Segment
{
	struct tree
	{
		ll cntl, cntr, cnt;
		tree operator + (const tree &t) const
		{
			return {cntl + t.cntl, cntr + t.cntr, cnt + t.cnt + cntl * t.cntr};
		}
	} tr[(N * 2) << 2];
	void pushup (int u) { tr[u] = tr[lc] + tr[rc]; }
	void modify (int u, int l, int r, int x, int w, int op)
	{
		if (l == r)
		{
			if (op == 1) tr[u].cntl += w;
			else tr[u].cntr += w;
			return;
		}
		int mid = l + r >> 1;
		if (x <= mid) modify (lc, l, mid, x, w, op);
		else modify (rc, mid + 1, r, x, w, op);
		pushup (u);
	}
	tree query (int u, int l, int r, int x, int y)
	{
		if (x <= l && y >= r) return tr[u];
		int mid = l + r >> 1;
		if (y <= mid) return query (lc, l, mid, x, y);
		if (x > mid) return query (rc, mid + 1, r, x, y);
		return query (lc, l, mid, x, y) + query (rc, mid + 1, r, x, y); 
	}
} seg;
int C (ll n, int m)
{
	if (m == 2) return n * (n - 1) / 2;
	else return n * (n - 1) * (n - 2) / 6;
}
signed main ()
{
//	freopen ("rectangle.in", "r", stdin); freopen ("rectangle.out", "w", stdout);
	// scanf ("%lld", &n);
	read(n);
	// for (int i = 1; i <= n; i ++ ) 
		// scanf ("%lld%lld%lld%lld", &a[i].x1, &a[i].x2, &a[i].y1, &a[i].y2);
	for (int i = 1; i <= n; i++) read(a[i].x1, a[i].x2, a[i].y1, a[i].y2);
	for (int i = 1; i <= n; i ++ ) tmp[ ++ tot] = a[i].x1, tmp[ ++ tot] = a[i].x2;
	sort (tmp + 1, tmp + 1 + tot); tot = unique (tmp + 1, tmp + 1 + tot) - (tmp + 1);
	for (int i = 1; i <= n; i ++ )
	{
		a[i].x1 = lower_bound (tmp + 1, tmp + 1 + tot, a[i].x1) - tmp;
		a[i].x2 = lower_bound (tmp + 1, tmp + 1 + tot, a[i].x2) - tmp;
	}
	tot = 0;
	for (int i = 1; i <= n; i ++ ) tmp[ ++ tot] = a[i].y1, tmp[ ++ tot] = a[i].y2;
	sort (tmp + 1, tmp + 1 + tot); tot = unique (tmp + 1, tmp + 1 + tot) - (tmp + 1);
	for (int i = 1; i <= n; i ++ )
	{
		a[i].y1 = lower_bound (tmp + 1, tmp + 1 + tot, a[i].y1) - tmp;
		a[i].y2 = lower_bound (tmp + 1, tmp + 1 + tot, a[i].y2) - tmp;
	}
	sort (a + 1, a + 1 + n);
	for (int i = 1; i <= n; i ++ )
	{
		line[a[i].x1] = {a[i].x1, a[i].y1, a[i].y2, i, 1};
		line[a[i].x2] = {a[i].x2, a[i].y1, a[i].y2, i, -1};
	}
	ll sum = 0;
	for (int i = 1; i <= n * 2; i ++ )
	{
		int x = line[i].id;
		if (line[i].flag == 1)
		{
			deg[x] += xiay2.query (line[i].y1 - 1) - xiay1.query (line[i].y2);
			sum += C (xjy1.query (line[i].y2) - xjy2.query (line[i].y1 - 1), 2) - seg.query (1, 1, n * 2, line[i].y1, line[i].y2).cnt;
			shangy1.modify (line[i].y1, 1), shangy2.modify (line[i].y2, 1);
			xjy1.modify (line[i].y1, 1), xjy2.modify (line[i].y2, 1);
			seg.modify (1, 1, n * 2, line[i].y2, 1, 1), seg.modify (1, 1, n * 2, line[i].y1, 1, 2);
		}
		else
		{
			deg[x] += shangy1.query (line[i].y2) - shangy2.query (line[i].y1 - 1);
			xiay1.modify (line[i].y1, 1); xiay2.modify (line[i].y2, 1);
			xjy1.modify (line[i].y1, -1); xjy2.modify (line[i].y2, -1);
			seg.modify (1, 1, n * 2, line[i].y2, -1, 1); seg.modify (1, 1, n * 2, line[i].y1, -1, 2);
		}
	}
	for (int i = 1; i <= n; i ++ ) deg[i] -- ;
	// for (int i = 1; i <= n; i++) write(deg[i], " \n"[i == n]);
	ll he = 0;
	// for (int i = 1; i <= n; i ++ ) he += deg[i];
	// he *= (n - 2);
	// for (int i = 1; i <= n; i ++ ) he -= 2 * C (deg[i], 2);
	for (int i = 1; i <= n; i++) he += deg[i] * (n - 1 - deg[i]);
	he /= 2;
	write(C(n, 3) - he - sum);
	flush();
	return 0;
}
/*
6
2 12 11 12
10 11 1 7
4 5 5 8
6 13 3 15
1 3 9 10
9 15 6 13
*/