#include <cmath>
#include <deque>
#include <algorithm>
#include <iterator>
#include <list>
#include <tuple>
#include <map>
#include <unordered_map>
#include <queue>
#include <set>
#include <unordered_set>
#include <stack>
#include <string>
#include <vector>
#include <fstream>
#include <iostream>
#include <functional>
#include <numeric>
#include <iomanip> 
#include <stdio.h>
#include <assert.h>
#include <cstring>
//eolibraries
#define lnf 3999999999999999999
#define inf 999999999
#define fi first
#define se second
#define pb push_back
#define ll long long
#define ld long double
#define all(c) (c).begin(),(c).end()
#define sz(c) (ll)(c).size()
#define make_unique(a) sort(all(a)),a.erase(unique(all(a)),a.end())
#define pii pair <ll,ll>
#define rep(i,n) for(ll i = 0 ; i < n ; i++) 
#define drep(i,n) for(ll i = n-1 ; i >= 0 ; i--)
#define crep(i,x,n) for(ll i = x ; i < n ; i++)
#define vi vector <ll> 
#define vec(...) vector<__VA_ARGS__>
#define fcin ios_base::sync_with_stdio(false),cin.tie(0),cout.tie(0);
//eodefine
using namespace std;

const ll mxn=4001;

ll a[mxn+10],b[mxn+10],c[mxn+10];

ll f(ll x){
	vi dp(mxn,0);
	rep(i,x+1){
		if(!b[i]) continue;
		dp[i]+=b[i];
	}
	drep(i,x+1) dp[i]+=dp[i+1];
	ll ans=0;
	rep(i,x+1){
		if(!c[i]) continue;
		// if(x==3) cout<<i<<" "<<dp[x-i]<<"\n";
		ans += dp[x-i+1]*c[i];
	}
	return ans;
}

int main(){
fcin;
	ll n;
	cin>>n;
	rep(i,n){
		ll x; cin>>x;
		a[x]++;
	}
	rep(i,n){
		ll x; cin>>x;
		b[x]++;
	}
	rep(i,n){
		ll x; cin>>x;
		c[x]++;
	}
	ll ans=0;
	rep(i,mxn){
		if(a[i]){
			f(i);
			// cout<<i<<" "<<f(i)<<"\n";
			ans+=a[i]*f(i);
		}
	}
	cout<<ans<<"\n";
//
	return 0;
}