#include "bits/stdc++.h"
//#include "atcoder/all"
using namespace std;
//using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
//using mint = modint998244353;
//const int mod = 998244353;
//const int INF = 1e9;
//const long long LINF = 1e18;
//const bool debug = false;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n-1); i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r-1);i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define endl "\n"
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }

int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int n; cin >> n;
	vector<int>r(3001), g(3001), b(3001);
	rep(i, n) {
		int x; cin >> x;
		r[x]++;
	}
	rep(i, n) {
		int x; cin >> x;
		g[x]++;
	}
	rep(i, n) {
		int x; cin >> x;
		b[x]++;
	}
	long long ans = 0;
	vector<int>sumb(3002);
	//[i,j)=sumb[j]-sumb[i];
	rep(i, 3001)sumb[i + 1] += sumb[i] + b[i];
	rep(i, 3001)rep(j, 3001) {
		if (i < j)continue;
		int _l = i - j + 1;
		int _r = i;
		if (0 == r[i])continue;
		if (0 == g[j])continue;
		ans += (long long)r[i] * g[j] * (sumb[_r + 1] - sumb[_l]);
	}
	cout << ans << endl;
	return 0;
}