#include <bits/stdc++.h>
#define rep(i,n) for(int i=(0);i<(n);i++)

using namespace std;

typedef long long ll;
typedef pair<int, int> pii;

int n;
vector<int> a, b, d;

bool cond(int k){
	if(k == 0) return true;

	bool dp[k+1][k+1];
	rep(i, k + 1) rep(j, k + 1) dp[i][j] = false;
	dp[0][0] = true;

	rep(i, k) {
		dp[i+1][0] = dp[i][0] && (d[k-i-1] <= a[i+1] + b[0]);
		rep(j, i) dp[i+1][j+1] = (dp[i][j] || dp[i][j+1]) && (d[k-i-1] <= a[i-j] + b[j+1]);
		dp[i+1][i+1] = dp[i][i] && (d[k-i-1] <= a[0] + b[i+1]);
	}

	rep(i, k + 1) if(dp[k][i]) return true;
	return false;
}

// condを満たす最大のxを求める(upper_bound)
// 全てのxが条件を満たさない場合は-1を返す(-1はとりえない値)
int upper_bound_cond(){
	int lb = -1, ub = n+1;

	while(ub - lb > 1){
		int mid = (lb + ub) / 2;

		bool ok = cond(mid);
		// cout << mid << "," << ok << "\n";
		if(ok) lb = mid;   // Answer is in [mid, ub)
		else ub = mid;            // Answer is in [lb, mid)
	}

	// now lb + 1 = ub
	return lb;
}

int main(){
	cin.tie(0);
	ios::sync_with_stdio(false);

	cin >> n;

	a.resize(n + 1);
	b.resize(n + 1);
	d.resize(n);
	rep(i, n + 1) cin >> a[i];
	rep(i, n + 1) cin >> b[i];
	rep(i, n) cin >> d[i];

	sort(d.begin(), d.end());
	cout << upper_bound_cond() << endl;
}