#include <iostream>
#include <string>
#include <algorithm>
#include <functional>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <cstdio>
#include <cmath>
#include <cassert>
#include <tuple>
#define rep(i, n) for(i = 0; i < n; i++)
#define int long long
using namespace std;

int n;
int cntR[3001];
int cntG[3001];
int cntB[3001];
int rcntB[3001];

signed main() {
	int i, j;
	
	cin >> n;
	rep(i, n) { int x; cin >> x; cntR[x]++; }
	rep(i, n) { int x; cin >> x; cntG[x]++; }
	rep(i, n) { int x; cin >> x; cntB[x]++; }
	
	for (i = 1; i <= 3000; i++) rcntB[i] = rcntB[i - 1] + cntB[i];
	
	int ans = 0;
	for (i = 1; i <= 3000; i++) {
		for (j = 1; j <= i; j++) {
			//cntB[k]: i + 1 - j <= k <= i
			int cnt = rcntB[i] - rcntB[i - j];
			ans += cntR[i] * cntG[j] * cnt;
		}
	}
	
	cout << ans << endl;
	return 0;
}