#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using ll = long long;
#define int ll
#define rng(i, a, b) for (int i = int(a); i < int(b); i++)
#define rep(i, b) rng(i, 0, b)
#define ALL(a) (a).begin(), (a).end()
template <class t, class u> void chmax(t& a, u b) {
    if (a < b) a = b;
}
template <class t, class u> void chmin(t& a, u b) {
    if (b < a) a = b;
}
template <class t> using vc = vector<t>;
template <class t> using vvc = vc<vc<t>>;
using pi = pair<int, int>;
using vi = vc<int>;
using uint = unsigned;
using ull = unsigned long long;
int popcount(signed t) { return __builtin_popcount(t); }
int popcount(ll t) { return __builtin_popcountll(t); }
bool ispow2(int i) { return i && (i & -i) == i; }
ll mask(int i) { return (ll(1) << i) - 1; }
int lcm(int a, int b) { return a / __gcd(a, b) * b; }
signed main() {
    cin.tie(0);
    ios::sync_with_stdio(0);
    cout << fixed << setprecision(20);
    int n;
    cin >> n;
    vc<int> r(n), g(n), b(n);
    rep(i, n) cin >> r[i];
    rep(i, n) cin >> g[i];
    rep(i, n) cin >> b[i];
    int ans = 0;
    sort(ALL(r));
    sort(ALL(g));
    sort(ALL(b));
    rep(i, n) {
        int gd = lower_bound(ALL(g), r[i] + 1) - g.begin();
        for (int j = 0; j < gd; j++) {
            int bmin = max(0LL, r[i] - g[j]);
            int bmax = min(r[i], max(0LL, 2 * r[i] - g[j]));
            // cout << bmin << " " << bmax << endl;
            auto num = lower_bound(ALL(b), bmax) - lower_bound(ALL(b), bmin);
            // cout << num << endl;
            ans += num;
        }
    }
    cout << ans << endl;
}