#include <cmath>
#include <vector>
#include <list>
#include <map>
#include <set>
#include <functional>
#include <queue>
#include <iostream>
#include <string.h>
#include <iomanip>
#include <algorithm>
#include <functional>
#include <cstdint>
#include <climits>
#include <unordered_set>
#include <unordered_map>
#include <sstream>
#include <stack>

using namespace std;

typedef long long int ll;
typedef pair<char,char> pcc;
typedef pair<ll,ll> P;
typedef tuple<ll,ll,ll> t3;

#define rep(i,a) for(ll i = 0;i < a;i++)

template <class T>
void cmax(T& a, const T b){a=max(a,b);}

const ll mod = 1e9+7;

int main(void) {
    ll n;
    cin >> n;
    vector<ll> as(n+1);
    vector<ll> bs(n+1);
    vector<ll> ds(n+1);
    rep(i,n+1) cin >> as[i];
    rep(i,n+1) cin >> bs[i];
    rep(i,n) cin >> ds[i];
    ll a = 0;
    ll b = 0;
    ll count = 0;
    rep(i,n){
        ll sum1 = as[a+1] + bs[b];
        ll sum2 = as[a] + bs[b+1];
        if(sum1 >= sum2){
            a++;
        }
        else{
            b++;
        }
        if(max(sum1, sum2) >= ds[i]) {
            count++;
        }
    }
    cout << count << endl;
    return 0;
}