#include<bits/stdc++.h>
//ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef pair<pii,int> ppii;
typedef pair<int,pii> pipi;
typedef pair<ll,ll> pll;
typedef pair<pll,ll> ppll;
typedef pair<ll,pll> plpl;
typedef tuple<ll,ll,ll> tl;
ll mod=1000000007;
ll mod2=998244353;
ll mod3=1000003;
ll mod4=998244853;
ll inf=1000000000;
double pi=2*acos(0);
#define rep(i,m,n) for(ll i=m;i<n;i++)
#define rrep(i,n,m) for(ll i=n;i>=m;i--)
int dh[4]={1,-1,0,0};
int dw[4]={0,0,1,-1};
int ddh[8]={-1,-1,-1,0,0,1,1,1};
int ddw[8]={-1,0,1,-1,1,-1,0,1};
ll lmax(ll a,ll b){
    if(a<b)return b;
    else return a;
}
ll lmin(ll a,ll b){
    if(a<b)return a;
    else return b;
}
ll gcd(ll a,ll b){
    if(a<b)swap(a,b);
    if(b==0)return a;
    if(a%b==0)return b;
    return gcd(b,a%b);
}
ll Pow(ll n,ll k){
    ll ret=1;
    ll now=n;
    while(k>0){
        if(k&1)ret*=now;
        now*=now;
        k/=2;
    }
    return ret;
}
ll beki(ll n,ll k,ll md){
  ll ret=1;
  ll now=n;
  while(k>0){
    if(k%2==1){
      ret*=now;
      ret%=md;
    }
    now*=now;
    now%=md;
    k/=2;
  }
  return ret;
}
ll gyaku(ll n,ll md){
  return beki(n,md-2,md);
}
int main(){
    ios::sync_with_stdio(false);cin.tie(0);
    ll n;cin>>n;
    ll a[n+1],b[n+1];
    rep(i,0,n+1)cin>>a[i];
    vector<ll> v;
    rep(i,0,n+1)cin>>b[i];
    ll na=0,nb=0;
    rep(i,0,n+1){
        v.push_back(a[na]+b[nb]);
        if(i==n)break;
        if(a[na+1]+b[nb]>=a[na]+b[nb+1])na++;
        else nb++;
    }
    ll d[n];
    rep(i,0,n)cin>>d[i];
    sort(d,d+n);
    reverse(d,d+n);
    ll dp[n+1];
    fill(dp,dp+n+1,0);
    ll ans=0;
    rep(i,0,n){
        ll now=v[dp[i]+1];
        rep(j,i+1,n+1){
            if(d[j-1]<=now)dp[j]=max(dp[j],dp[i]+1);
        }
    }
    rep(i,0,n+1)ans=max(ans,dp[i]);
    cout<<ans<<endl;
    //rep(i,0,n+1)cout<<dp[i]<<" ";
}