#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;
int main() {
	int N;
	cin >> N;
	vector<int> A(N + 1), B(N + 1), D(N);
	for (int i = 0; i <= N; ++i) cin >> A[i];
	for (int i = 0; i <= N; ++i) cin >> B[i];
	for (int i = 0; i < N; ++i) cin >> D[i];
	sort(D.begin(), D.end());
	int l = 0, r = N + 1;
	while (r - l > 1) {
		int m = (l + r) >> 1;
		vector<int> seq(m);
		for (int i = 0; i < m; ++i) {
			seq[i] = D[m - i - 1];
		}
		vector<vector<bool> > dp(N + 1, vector<bool>(N + 1, false));
		dp[0][0] = true;
		bool ok = false;
		for (int i = 0; i <= N; ++i) {
			for (int j = (i == 0 ? 1 : 0); i + j <= m; ++j) {
				if (A[i] + B[j] >= seq[i + j - 1] && ((i >= 1 && dp[i - 1][j]) || (j >= 1 && dp[i][j - 1]))) {
					dp[i][j] = true;
					if (i + j == m) ok = true;
				}
			}
		}
		if (ok) l = m;
		else r = m;
	}
	cout << l << endl;
	return 0;
}