#include <bits/stdc++.h>
using namespace std;
using ll = long long;

constexpr int K = 3000;
ll p[K + 1][K + 1];
ll s0[K + 1];
ll s1[K + 1];

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

    int n;
    cin >> n;

    vector<int> r(n);
    for (int i = 0; i < n; i++) {
        cin >> r[i];
    }

    for (int i = 0; i < n; i++) {
        int g;
        cin >> g;
        p[0][g]++;
    }
    for (int i = 0; i < n; i++) {
        int b;
        cin >> b;
        p[b][0]++;
    }
    for (int i = 1; i <= K; i++) {
        for (int j = 1; j <= K; j++) {
            p[i][j] = p[i][0] * p[0][j];
        }
    }

    for (int i = 1; i <= K; i++) {
        ll s = s0[i - 1];
        for (int j = 1; j < i; j++) {
            s += p[i][j] + p[j][i];
        }
        s0[i] = s + p[i][i];
    }
    for (int i = 1; i <= K; i++) {
        ll s = s1[i - 1];
        for (int j = 1; j <= i; j++) {
            s += p[i - j + 1][j];
        }
        s1[i] = s;
    }

    ll x = 0;
    for (int i = 0; i < n; i++) {
        int t = r[i];
        x += s0[t] - s1[t - 1];
    }
    cout << x << endl;

    return 0;
}