#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
using namespace std;
typedef long long int ll;
typedef pair<int,int> P;
#define yn {puts("Yes");}else{puts("No");}
#define MAX_N 200005

int main() {
    int n;
    cin >> n;
    ll a[n+2], b[n+2], d[n+1];
    rep(i,n+1) cin >> a[i];
    rep(i,n+1) cin >> b[i];
    rep(i,n) cin >> d[i];
    a[n+1] = -1001001001;
    b[n+1] = -1001001001;
    d[n] = 1001001001;
    n++;

    sort(d,d+n);

    int l = 0;
    int r = n;

    while(l+1<r){
        int m = (l+r)/2;
        int dp[m][m+1];
        rep(i,m)rep(j,m+1)dp[i][j] = 0;
        rep(i,m){
            if(i == 0){
                if(a[1]+b[0] >= d[m-1]){
                    dp[0][1] = 1;
                }
                if(a[0]+b[1] >= d[m-1]){
                    dp[0][0] = 1;
                }
            }else{
                rep(j,i+2){
                    if(a[j]+b[i+1-j] < d[m-1-i]) continue;
                    if(i-j>=0 && dp[i-1][j] == 1) dp[i][j] = 1;
                    if(j>0 && dp[i-1][j-1] == 1) dp[i][j] = 1;
                }
            }
        }
        int ok = 0;
        rep(j,m+1){
            if(dp[m-1][j] == 1){
                ok = 1;
                break;
            }
        }
        if(ok) l = m;
        else r = m;
    }

    cout << l << endl;
    return 0;
}