#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,m,n) for(int i=(m);i<(n);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
using ll = long long;
constexpr int INF = 0x3f3f3f3f;
constexpr long long LINF = 0x3f3f3f3f3f3f3f3fLL;
constexpr double EPS = 1e-8;
constexpr int MOD = 1000000007;
// constexpr int MOD = 998244353;
constexpr int dy[] = {1, 0, -1, 0}, dx[] = {0, -1, 0, 1};
constexpr int dy8[] = {1, 1, 0, -1, -1, -1, 0, 1}, dx8[] = {0, -1, -1, -1, 0, 1, 1, 1};
template <typename T, typename U> inline bool chmax(T &a, U b) { return a < b ? (a = b, true) : false; }
template <typename T, typename U> inline bool chmin(T &a, U b) { return a > b ? (a = b, true) : false; }
struct IOSetup {
  IOSetup() {
    std::cin.tie(nullptr);
    std::ios_base::sync_with_stdio(false);
    std::cout << fixed << setprecision(20);
  }
} iosetup;

int main() {
  constexpr int L = 3000;
  int n; cin >> n;
  int r[L + 1]{}, g[L + 1]{}, b[L + 1]{};
  REP(i, n) {
    int ri; cin >> ri;
    ++r[ri];
  }
  REP(i, n) {
    int gi; cin >> gi;
    ++g[gi];
  }
  REP(i, n) {
    int bi; cin >> bi;
    ++b[bi];
  }
  FOR(i, 1, L + 1) b[i] += b[i - 1];
  ll ans = 0;
  FOR(i, 1, L + 1) FOR(j, 1, i + 1) {
    ans += 1LL * r[i] * g[j] * (b[i] - b[i - j]);
  }
  cout << ans << '\n';
  return 0;
}