#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#define _GLIBCXX_DEBUG
using namespace std;
using std::cout;
using std::cin;
using std::endl;
using ll=long long;
using ld=long double;
ll I=1167167167167167167;
ll mod=1e9+7;
#define rep(i,a) for (ll i=0;i<a;i++)
template<class T> using _pq = priority_queue<T, vector<T>, greater<T>>;
template<class T> ll LB(vector<T> &v,T a){return lower_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> ll UB(vector<T> &v,T a){return upper_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> bool chmin(T &a,const T &b){if(a>b){a=b;return 1;}else return 0;}
template<class T> bool chmax(T &a,const T &b){if(a<b){a=b;return 1;}else return 0;}
template<class T> void So(vector<T> &v) {sort(v.begin(),v.end());}
template<class T> void Sore(vector<T> &v) {sort(v.begin(),v.end(),[](T x,T y){return x>y;});}
void yneos(bool a){if(a) cout<<"Yes\n"; else cout<<"No\n";}



//おちこんだりもしたけれど、私はげんきです。
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	
	int n;
	cin>>n;
	int m=3010,a;
	vector<ll> r(m),b(m),g(m);
	rep(i,n) cin>>a,r[a]++;
	rep(i,n) cin>>a,b[a]++;
	rep(i,n) cin>>a,g[a]++;
	rep(i,m-1) r[i+1]+=r[i];
	ll ans=0;
	rep(i,m) rep(j,m){
		//cout<<b[i]<<" "<<g[j]<<endl;
		if(i+j>m||i==0) break;
		ans+=(r[i+j-1]-r[max(i,j)-1])*b[i]*g[j];
	}
	cout<<ans<<"\n";
}