// yuki 1623 三角形の制作
// 2021.8.10

#include <stdio.h>

typedef long long ll;
#define gc() getchar_unlocked()
#define pc(c) putchar_unlocked(c)

int in() {   // 非負整数の入力
	int n = 0; int c = gc();
	do n = 10 * n + (c & 0xf); while ((c = gc()) >= '0');
	return n;
}
void out(ll n) { // 非負整数の表示（出力）
	int i; char b[30];

	if (!n) pc('0');
	else {
		//		if (n < 0) pc('-'), n = -n;
		i = 0; while (n) b[i++] = n % 10 + '0', n /= 10;
		while (i--) pc(b[i]);
	}
	pc('\n');
}

const int max = 3000;
int N;
int a[200005], g[3005], b[3005];
ll ans;

int cmp(const void *a, const void *b) {
	return *(int *)a - *(int *)b;
}

// a[i]>=x という条件を満たす最小のi
int lower_bound(int x) {
	int m, l = 0, r = N;
	while (l+1 < r) {
		m = (l+r) >> 1;
		if (a[m] < x) l = m; else r = m;
	}
	return a[l] < x? r: l;
}

// a[i]>x という条件を満たす最小のi
int upper_bound(int l, int x) {
	int m, r = N;
	while (l+1 < r) {
		m = (l+r) >> 1;
		if (a[m] <= x) l = m; else r = m;
	}
	return a[l] <= x? r: l;
}

#define MAX(a,b) ((a)>=(b)?(a):(b))

int main() {
	int i, j, k, gmi, bmi, gma, bma;
	N = in();
	for (i = 0; i < N; ++i) a[i] = in();
	qsort(a, N, sizeof(int), cmp);
	for (i = 0; i < N; ++i) g[in()]++;
	gmi = 1; while (!g[gmi]) gmi++;
	gma = max; while (!g[gma]) gma--;
	for (i = 0; i < N; ++i) b[in()]++;
	bmi = 1; while (!b[bmi]) bmi++;
	bma = max; while (!b[bma]) bma--;
	for (i = gmi; i <= gma; ++i) {
		for (j = bmi; j <= bma; ++j) {
			k = lower_bound(MAX(i, j));
			k = upper_bound(k, i+j-1)-k;
			ans += (ll)g[i]*b[j]*k;
		}
	}
	out(ans);
	return 0;
}