#include<iostream>
#include<vector>
#include<algorithm>

using namespace std;
using ll = long long;


int main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);

    int n;
    cin>>n;
    vector<int> r(n),g(n),b(n);
    for(int i = 0;i<n;i++) cin>>r[i];
    for(int i = 0;i<n;i++) cin>>b[i];
    for(int i = 0;i<n;i++) cin>>g[i];
    const int mx = 3e3 + 1;
    vector<ll> cb(mx,0),cg(mx,0);
    vector<ll> sum(mx+1,0);
    for(int i = 0;i<n;i++) sum[r[i]+1]++;
    for(int i = 0;i<mx;i++) sum[i+1] += sum[i];
    ll ans = 0;
    for(int i = 0;i<n;i++) cb[b[i]]++;
    for(int i = 0;i<n;i++) cg[g[i]]++;
    for(int i = 0;i<mx;i++) {
        if(cb[i]==0) continue;
        for(int j = 0;j<mx;j++){
            if(cg[j]==0) continue;
            int ri = i + j;
            int le = max(i,j);
            if(ri>mx) ri = mx;
            if(le<ri) ans += sum[ri] - sum[le];
        }
    }
    cout<<ans<<endl;
}