#include "bits/stdc++.h"
using namespace std;
#define int long long
#define FOR(i, a, b) for(int i=(a);i<(b);i++)
#define RFOR(i, a, b) for(int i=(b-1);i>=(a);i--)
#define REP(i, n) for(int i=0; i<(n); i++)
#define RREP(i, n) for(int i=(n-1); i>=0; i--)
#define ALL(a) (a).begin(),(a).end()
#define UNIQUE_SORT(l) sort(ALL(l)); l.erase(unique(ALL(l)), l.end());
#define CONTAIN(a, b) find(ALL(a), (b)) != (a).end()
#define array2(type, x, y) array<array<type, y>, x>
#define vector2(type) vector<vector<type> >
#define out(...) printf(__VA_ARGS__)

int dxy[] = {0, 1, 0, -1, 0};

/*================================*/

int N,M,L;

signed main()
{
#if DEBUG
    std::ifstream in("input.txt");
    std::cin.rdbuf(in.rdbuf());
#endif
    cin>>N;
    
    int A[N+1], B[N+1], D[N];
    REP(i,N+1) cin>>A[i];
    REP(i,N+1) cin>>B[i];
    REP(i,N) cin>>D[i];
    
    sort(D,D+N,greater<int>());
    
    int ans = 0;
    int ai = 0;
    int bi = 0;
    REP(d,N) {
        if (A[ai+1]+B[bi] >= A[ai]+B[bi+1]) {
            ai++;
        } else {
            bi++;
        }
        int power = A[ai]+B[bi];
        while(d<N) {
            if (power >= D[d]) {
                ans++;
                break;
            }
            d++;
        }
    }
    
    cout << ans << endl;
    
    return 0;
}