#include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;

#undef _P
#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x,to) for(x=0;x<(to);x++)
#define FORR(x,arr) for(auto& x:arr)
#define ITR(x,c) for(__typeof(c.begin()) x=c.begin();x!=c.end();x++)
#define ALL(a) (a.begin()),(a.end())
#define ZERO(a) memset(a,0,sizeof(a))
#define MINUS(a) memset(a,0xff,sizeof(a))
//-------------------------------------------------------

int N;
int A[3030];
int B[3030];
int ok[3030][3030];
int D[3030];

void solve() {
	int i,j,k,l,r,x,y; string s;
	
	cin>>N;
	FOR(i,N+1) cin>>A[i];
	FOR(i,N+1) cin>>B[i];
	FOR(i,N) cin>>D[i];
	ok[0][0]=1;
	
	int ma=0;
	FOR(x,N+1) FOR(y,N+1) if(ok[x][y]) {
		ma=max(ma,x+y);
		if(x+1+y<=N) {
			if(A[x+1]+B[y]>=D[x+y]) ok[x+1][y]=1;
			if(A[x]+B[y+1]>=D[x+y]) ok[x][y+1]=1;
		}
	}
	cout<<ma<<endl;
}


int main(int argc,char** argv){
	string s;int i;
	if(argc==1) ios::sync_with_stdio(false), cin.tie(0);
	FOR(i,argc-1) s+=argv[i+1],s+='\n'; FOR(i,s.size()) ungetc(s[s.size()-1-i],stdin);
	cout.tie(0); solve(); return 0;
}