#include<iostream>
#include<string>
#include<vector>
#include<algorithm>
#include<bitset>
#include<set>
#include<map>
#include<stack>
#include<queue>
#include<deque>
#include<list>
#include<iomanip>
#include<cmath>
#include<cstring>
#include<functional>
#include<cstdio>
#include<cstdlib>
#include<numeric>
#include<ctime>
//#include<atcoder/all>
using namespace std;
//using namespace atcoder;

#define repr(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define rep(i, n) repr(i, 0, n)
#define INF 2e9
//#define MOD 1000000007
#define MOD 998244353
#define LINF (long long)4e18
#define jck 3.141592
#define PI acos(-1.0)

const double EPS = 1e-10;

using ll = long long;
using Pi = pair<int,int>;
using Pl = pair<ll,ll>;
//using mint = modint1000000007;

int dh[] = {-1,0,1,0};
int dw[] = {0,1,0,-1};


int main(){
    int n; cin >> n;
    vector<vector<ll>> cnt(3001,vector<ll>(3));
    rep(i,n){
        int r; cin >> r;
        cnt[r][0]++;
    }
    rep(i,n){
        int g; cin >> g;
        cnt[g][1]++;
    }
    rep(i,n){
        int b; cin >> b;
        cnt[b][2]++;
    }
    vector<ll> sum(3002);
    rep(i,3001) sum[i+1] = sum[i]+cnt[i][0];
    ll ans = 0;
    rep(i,3001)rep(j,3001){
        ans += cnt[i][1]*cnt[j][2]*(sum[min(3001,i+j)]-sum[max(i,j)]);
    }
    cout << ans <<endl;

}