//#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define rep(i, n) for(int i=0; i<n; ++i)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
using namespace std;
using ll = int64_t;
using ld = long double;
using P = pair<int, int>;
using vs = vector<string>;
using vi = vector<int>;
using vvi = vector<vi>;
template<class T> using PQ = priority_queue<T>;
template<class T> using PQG = priority_queue<T, vector<T>, greater<T> >;
const int INF = 0xccccccc;
const ll LINF = 922337203685477580LL;
template<typename T1, typename T2>
inline bool chmax(T1 &a, T2 b) {return a < b && (a = b, true);}
template<typename T1, typename T2>
inline bool chmin(T1 &a, T2 b) {return a > b && (a = b, true);}
template<typename T1, typename T2>
istream &operator>>(istream &is, pair<T1, T2> &p) { return is >> p.first >> p.second;}
template<typename T1, typename T2>
ostream &operator<<(ostream &os, const pair<T1, T2> &p) { return os << p.first << ' ' << p.second;}

const int N = 3010;

//head

int n;
int a[N], b[N], d[N];
int ans;
int dp[N], dpp[N];
int *now = dp, *pre = dpp;

int main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	cin >> 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);

	int k = n;
	rep(i, n+1) {
		if(!i) dpp[0] = k;
		else {
			do{k--;}while(k >= 0 and d[k] > a[0]+b[i]);
			dpp[i] = k;
			if(k >= 0) ans = i;
		}
	}
	//rep(i, n) cout << d[i] << (i == n-1?'\n':' ');
	//rep(i, n+1) cout << dpp[i] << (i == n ? '\n':' ');
	for(int i = 1; i <= n; i++) {
		rep(j, n-i+1) {
			if(!j) {
				if(pre[j] < 0) {
					now[j] = -1;
					continue;
				}
				now[j] = upper_bound(d, d+pre[j], a[i]+b[0]) - d - 1;
				if(now[j] >= 0)chmax(ans, i+j);
			}
			else {
				int u = max(pre[j], now[j-1]);
				if(u < 0) {
					now[j] = -1;
					continue;
				}
				now[j] = upper_bound(d, d+u, a[i]+b[j]) - d - 1;
				if(now[j] < 0) {
					continue;
				}
				chmax(ans, i+j);
			}
		}
		swap(now, pre);
		//rep(j, n-i+1) {	cout << pre[j] << (j == n-i?'\n':' ');}
	}

	cout << ans << endl;
}