// #define DEBUGGING
#include <bits/stdc++.h>
#define endl '\n'
#define ALL(V) (V).begin(), (V).end()
#define ALLR(V) (V).rbegin(), (V).rend()
template <typename T> using V = std::vector<T>;
template <typename T> using VV = V<V<T>>;
using ll = std::int64_t;
using ull = std::uint64_t;
using PLL = std::pair<ll, ll>;
using TLL = std::tuple<ll, ll, ll>;
template <typename T> const T& var_min(const T &t) { return t; }
template <typename T> const T& var_max(const T &t) { return t; }
template <typename T, typename... Tail> const T& var_min(const T &t, const Tail&... tail) { return std::min(t, var_min(tail...)); }
template <typename T, typename... Tail> const T& var_max(const T &t, const Tail&... tail) { return std::max(t, var_max(tail...)); }
template <typename T, typename... Tail> void chmin(T &t, const Tail&... tail) { t = var_min(t, tail...); }
template <typename T, typename... Tail> void chmax(T &t, const Tail&... tail) { t = var_max(t, tail...); }
template <typename T> const T& clamp(const T &t, const T &low, const T &high) { return std::max(low, std::min(high, t)); }
template <typename T> void chclamp(T &t, const T &low, const T &high) { return t = clamp(t, low, high); }
namespace init__ { struct InitIO { InitIO() { std::cin.tie(nullptr); std::ios_base::sync_with_stdio(false); std::cout << std::fixed << std::setprecision(30); } } init_io; }
#define mv_rec make_v(init, tail...)
template <typename T> T make_v(T init) { return init; }
template <typename T, typename... Tail> auto make_v(T init, size_t s, Tail... tail) { return V<decltype(mv_rec)>(s, mv_rec); }
#undef mv_rec
using namespace std;
#ifdef DEBUGGING
#include "../../debug/debug.cpp"
#else
#define DEBUG(...) 0
#define DEBUG_SEPARATOR_LINE 0
#endif

const size_t SIZE = 3010;
PLL dp[SIZE][SIZE];

void input(V<ll> &v) {
    for(ll &e : v) cin >> e;
}

const ll inf = 5e15;

int main() {
    ll N;
    cin >> N;
    V<ll> A(N + 1), B(N + 1), D(N);
    input(A);
    input(B);
    input(D);
    sort(ALL(D));
    dp[0][0] = PLL(0, N);
    for(ll n = 0; n < N; n++) {
        for(ll i = 0; i <= n; i++) {
            ll j = n - i;
            PLL nxt[] = { { i + 1, j }, { i, j + 1 }  };
            for(ll k = 0; k <= 1; k++) {
                ll ni, nj;
                tie(ni, nj) = nxt[k];
                if(N < max(ni, nj)) continue;
                ll contr = A[ni] + B[nj];
                auto pre = dp[i][j];
                ll ok = 0, ng = dp[i][j].second;
                chmax(dp[ni][nj], pre);
                if(pre.second == 0) continue;
                if(contr < D[ok]) continue;
                while(ng - ok > 1) {
                    ll mid = (ok + ng) / 2;
                    (D[mid] <= contr ? ok : ng) = mid;
                }
                pre.first++;
                pre.second = ok;
                chmax(dp[ni][nj], pre);
            }
        }
    }

    ll ans = 0;
    for(ll i = 0; i < SIZE; i++) for(ll j = 0; j < SIZE; j++) chmax(ans, dp[i][j].first);
    cout << ans << endl;
    return 0;
}