/*
    Author:zeke
    
    pass System Test!
    GET AC!!
*/
#include <iostream>
#include <queue>
#include <vector>
#include <iostream>
#include <vector>
#include <string>
#include <cassert>
#include <algorithm>
#include <functional>
#include <cmath>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <map>
#include <iomanip>
#include <math.h>
#include <utility>
#include <stack>
#include <bitset>
using ll = long long;
using ld = long double;
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define rep3(var, min, max) for (ll(var) = (min); (var) < (max); ++(var))
#define repi3(var, min, max) for (ll(var) = (max)-1; (var) + 1 > (min); --(var))
#define Mp(a, b) make_pair((a), (b))
#define F first
#define S second
#define Icin(s) \
    ll(s);      \
    cin >> (s);
#define Scin(s) \
    ll(s);      \
    cin >> (s);
template <class T>
bool chmax(T &a, const T &b)
{
    if (a < b)
    {
        a = b;
        return 1;
    }
    return 0;
}
template <class T>
bool chmin(T &a, const T &b)
{
    if (b < a)
    {
        a = b;
        return 1;
    }
    return 0;
}
typedef pair<ll, ll> P;
typedef vector<ll> V;
typedef vector<V> VV;
typedef vector<P> VP;
ll mod = 1e9 + 7;
unsigned long long MOD = 1e9 + 7;
ll INF = 1e18;

int main()
{
    cin.tie(0);
    ios::sync_with_stdio(false);
    ll n;
    cin >> n;
    V ken(n + 1);
    V koo(n + 1);
    V score(n);
    rep(i, n + 1) cin >> ken[i];
    rep(i, n + 1) cin >> koo[i];
    rep(i, n) cin >> score[i];
    sort(all(score));
    //    rep(i,n)cout<<score[i]<<" ";
    // cout<<endl;
    vector<vector<ll>> dp(n + 1, vector<ll>(n + 1, 0));
    //   cout<<score[0]<<endl;
    VV reg(n+1,V(n+1));
    
    rep(i, n + 1)
    {
        rep(j, n + 1)
        {
            //  cout<<ken[i]<<" "<<koo[j]<<" "<<score[i+j-1]<<" ";
            if (i + j > n)
                continue;
            if (i == 0 && j == 0){
                dp[i][j] = 500;
                reg[0][0]=1e18;
                continue;
            }
            ll k = upper_bound(all(score), ken[i] + koo[j]) - score.begin();
          //  cout<<k<<endl;
            if(k==0){
                reg[i][j]=-1;
                continue;
            }
            if (i == 0 && dp[i][j - 1]){
                chmin(k,reg[i][j-1]-1);
                reg[i][j]=k;
                if(k<=0)continue;
                dp[i][j] = score[k-1];
            }else if (j == 0){
                chmin(k,reg[i-1][j]-1);
                reg[i][j]=k;
                if(k<=0)continue;
                dp[i][j] = score[k-1];
               // if(i==1)cout<<score[]<<endl;
            }else if (dp[i][j - 1] || dp[i - 1][j]){
                k=min(k,max(dp[i][j-1],dp[i-1][j]));
                reg[i][j]=k;
                if(k<=0)continue;
                dp[i][j] = score[k-1];
            }
        }
    }
    ll res = 0;
    rep(i, n + 1)
    {
        rep(j, n + 1)
        {
         //   cout << dp[i][j] << " ";
            if (dp[i][j])
                chmax(res, (ll)i + j);
        }
     //   cout << endl;
    }
    cout << res << endl;
}