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 int[][](N + 1, N + 1);
      foreach (x; 0 .. N + 1) {
        dp[x][] = -1;
      }
      dp[0][0] = N;
      foreach (x; 0 .. N + 1) {
        int i = N - 1;
        foreach (y; 0 .. N + 1 - x) {
          for (; i >= 0 && A[x] + B[y] < D[i]; --i) {}
          if (x > 0) {
            chmax(dp[x][y], min(dp[x - 1][y] - 1, i));
          }
          if (y > 0) {
            chmax(dp[x][y], min(dp[x][y - 1] - 1, i));
          }
        }
      }
      
      int ans;
      foreach (x; 0 .. N) foreach (y; 0 .. N + 1 - x) {
        if (dp[x][y] >= 0) {
          chmax(ans, x + y);
        }
      }
      writeln(ans);
    }
  } catch (EOFException e) {
  }
}