import sys

sys.setrecursionlimit(10**6)
int1 = lambda x: int(x)-1
p2D = lambda x: print(*x, sep="\n")
def II(): return int(sys.stdin.buffer.readline())
def LI(): return list(map(int, sys.stdin.buffer.readline().split()))
def LI1(): return list(map(int1, sys.stdin.buffer.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]
def BI(): return sys.stdin.buffer.readline().rstrip()
def SI(): return sys.stdin.buffer.readline().rstrip().decode()
# dij = [(0, 1), (-1, 0), (0, -1), (1, 0)]
dij = [(0, 1), (-1, 0), (0, -1), (1, 0), (1, 1), (1, -1), (-1, 1), (-1, -1)]
inf = 10**16
# md = 998244353
md = 10**9+7

n = II()
aa = LI()
bb = LI()
dd = LI()
dd.sort(reverse=True)

def ok(m):
    stack = [(0, 0, m)]
    fin = [False]*(n+1)*(n+1)
    while stack:
        i, j, k = stack.pop()
        if k == n: return True
        if aa[i+1]+bb[j] >= dd[k] and not fin[(i+1)*(n+1)+j]:
            fin[(i+1)*(n+1)+j] = True
            stack.append((i+1, j, k+1))
        if aa[i]+bb[j+1] >= dd[k] and not fin[i*(n+1)+j+1]:
            fin[i*(n+1)+j+1] = True
            stack.append((i, j+1, k+1))
    return False

l, r = -1, n
while l+1 < r:
    m = (l+r)//2
    if ok(m): r = m
    else: l = m

print(n-r)