#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < n; i++)
#define rep2(i, x, n) for(int i = x; i <= n; i++)
#define rep3(i, x, n) for(int i = x; i >= n; i--)
#define each(e, v) for(auto &e: v)
#define pb push_back
#define eb emplace_back
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define sz(x) (int)x.size()
using ll = long long;
using pii = pair<int, int>;
using pil = pair<int, ll>;
using pli = pair<ll, int>;
using pll = pair<ll, ll>;
const int MOD = 1000000007;
//const int MOD = 998244353;
const int inf = (1<<30)-1;
const ll INF = (1LL<<60)-1;
template<typename T> bool chmax(T &x, const T &y) {return (x < y)? (x = y, true) : false;};
template<typename T> bool chmin(T &x, const T &y) {return (x > y)? (x = y, true) : false;};

struct io_setup{
    io_setup(){
        ios_base::sync_with_stdio(false);
        cin.tie(NULL);
        cout << fixed << setprecision(15);
    }
} io_setup;

int main(){
    int N; cin >> N;

    int M = 3000;
    vector<vector<int>> a(3, vector<int>(N));
    vector<vector<ll>> b(3, vector<ll>(M+1, 0));

    rep(i, 3){
        rep(j, N){
            cin >> a[i][j];
            b[i][a[i][j]]++;
        }
    }

    ll ans = 0;

    vector<ll> c(M+2, 0);
    rep(i, M+1) c[i+1] = c[i]+b[2][i];

    rep2(i, 1, M) rep2(j, 1, i){
        int L = i-j+1, R = i+1;
        ans += b[0][i]*b[1][j]*(c[R]-c[L]);
    }

    cout << ans << '\n';
}