/* -*- coding: utf-8 -*-
 *
 * 949.cc:  No.949 飲酒プログラミングコンテスト - yukicoder
 */

#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<iostream>
#include<string>
#include<vector>
#include<map>
#include<set>
#include<stack>
#include<list>
#include<queue>
#include<deque>
#include<algorithm>
#include<numeric>
#include<utility>
#include<complex>
#include<functional>
 
using namespace std;

/* constant */

const int MAX_N = 3000;

/* typedef */

/* global variables */

int as[MAX_N + 1], bs[MAX_N + 1], ds[MAX_N];
bool dp[MAX_N + 1][MAX_N + 1];

/* subroutines */

bool check(int k) {
  memset(dp, false, sizeof(dp));
  dp[0][0] = true;

  for (int i = 0; i < k; i++)
    for (int j = 0; i + j < k; j++)
      if (dp[i][j]) {
	int dij = ds[k - 1 - (i + j)];
	if (as[i + 1] + bs[j] >= dij) dp[i + 1][j] = true;
	if (as[i] + bs[j + 1] >= dij) dp[i][j + 1] = true;
      }

  for (int i = 0; i <= k; i++)
    if (dp[i][k - i]) return true;
  return false;
}

/* main */

int main() {
  int n;
  scanf("%d", &n);

  for (int i = 0; i <= n; i++) scanf("%d", as + i);
  for (int i = 0; i <= n; i++) scanf("%d", bs + i);
  for (int i = 0; i < n; i++) scanf("%d", ds + i);
  sort(ds, ds + n);

  int k0 = 0, k1 = n + 1;
  while (k0 + 1 < k1) {
    int k = (k0 + k1) / 2;
    if (check(k)) k0 = k;
    else k1 = k;
  }

  printf("%d\n", k0);
  return 0;
}