#include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i,n) for(int i=0;i<n;i++)

signed main(){
  int n;
  cin>>n;
  vector<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];
  sort(r.begin(),r.end());
  sort(g.begin(),g.end());
  sort(b.begin(),b.end());  
  int cnt=0;
  rep(i,n){
    rep(j,n){
      if(r[i]<g[j]) continue;
      //r[i]>b[k] r[i]<g[j]+b[k])
      int lx=lower_bound(b.begin(),b.end(),r[i]-g[j])-b.begin();
      int rx=lower_bound(b.begin(),b.end(),r[i])-b.begin();
      //cout<<rx<<" "<<lx<<endl;
      cnt+=rx-lx;
    }
  }
  cout<<cnt<<endl;  
  return 0;
}