import std.conv, std.functional, std.range, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.bitmanip, std.complex, std.container, std.math, std.mathspecial, std.numeric, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }
real readReal() { return readToken.to!real; }

bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }

int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }
int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }
int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }




void main() {
  try {
    for (; ; ) {
      const N = readInt();
      auto A = new int[N + 1];
      foreach (i; 0 .. N + 1) {
        A[i] = readInt();
      }
      auto B = new int[N + 1];
      foreach (i; 0 .. N + 1) {
        B[i] = readInt();
      }
      auto D = new int[N];
      foreach (i; 0 .. N) {
        D[i] = readInt();
      }
      D.sort;
      
      auto dp = new bool[][](N + 1, N + 1);
      bool check(int m) {
        foreach (x; 0 .. m + 1) foreach (y; 0 .. m + 1) {
          dp[x][y] = false;
        }
        dp[0][0] = true;
        foreach (x; 0 .. m) foreach (y; 0 .. m - x) {
          if (dp[x][y]) {
            const d = D[m - 1 - (x + y)];
            if (A[x + 1] + B[y] >= d) {
              dp[x + 1][y] = true;
            }
            if (A[x] + B[y + 1] >= d) {
              dp[x][y + 1] = true;
            }
          }
        }
        foreach (x; 0 .. m + 1) {
          if (dp[x][m - x]) {
            return true;
          }
        }
        return false;
      }
      
      int lo = 0, hi = N + 1;
      for (; lo + 1 < hi; ) {
        const mid = (lo + hi) / 2;
        (check(mid) ? lo : hi) = mid;
      }
      writeln(lo);
    }
  } catch (EOFException e) {
  }
}