#include <cassert>
#include <cmath>
#include <algorithm>
#include <iostream>
#include <iomanip>
#include <climits>
#include <map>
#include <queue>
#include <set>
#include <cstring>
#include <vector>

using namespace std;
typedef long long ll;

const int MAX_N = 3010;
int N;
int A[MAX_N];
int B[MAX_N];
vector<int> D;

bool f(int x) {
  bool dp[N + 2][N + 2];
  memset(dp, false, sizeof(dp));
  dp[0][0] = true;

  for (int i = 0; i < x; ++i) {
    int d = N - x + i;

    for (int a = 0; a <= i; ++a) {
      int b = i - a;
      if (not dp[a][b]) continue;

      int na = a + 1;
      int nb = b + 1;

      if (D[d] <= A[na] + B[b]) {
        dp[na][b] = true;
      }
      if (D[d] <= A[a] + B[nb]) {
        dp[a][nb] = true;
      }
    }
  }

  for (int a = 0; a <= x; ++a) {
    int b = x - a;
    if (dp[a][b]) return true;
  }

  return false;
}

int main() {
  cin >> N;

  for (int i = 0; i < N + 1; ++i) {
    cin >> A[i];
  }

  for (int i = 0; i < N + 1; ++i) {
    cin >> B[i];
  }

  D.resize(N);
  for (int i = 0; i < N; ++i) {
    cin >> D[i];
  }

  sort(D.begin(), D.end());
  reverse(D.begin(), D.end());
  int ok = 0;
  int ng = N + 1;

  while (abs(ok - ng) >= 2) {
    int x = (ok + ng) / 2;

    if (f(x)) {
      ok = x;
    } else {
      ng = x;
    }
  }

  cout << ok << endl;

  return 0;
}