from collections import deque


def main():
    N = int(input())
    A = list(map(int, input().split()))
    B = list(map(int, input().split()))
    D = list(map(int, input().split()))

    D.sort()
    ok = 0
    ng = N+1
    mid = (ok + ng) // 2
    seen = [0] * ((N+1)**2)
    while ng - ok > 1:
        st = deque()
        st.append((0, 0))
        seen[0] = mid
        flg = 0
        while st:
            i, j = st.popleft()
            k = i+j+1
            if seen[(i+1) * (N+1) + j] != mid:
                seen[(i+1) * (N+1) + j] = mid
                if A[i+1] + B[j] >= D[mid-k]:
                    if k == mid:
                        flg = 1
                        break
                    st.append((i+1, j))
            if seen[i * (N+1) + j+1] != mid:
                seen[i * (N+1) + j+1] = mid
                if A[i] + B[j+1] >= D[mid-k]:
                    if k == mid:
                        flg = 1
                        break
                    st.append((i, j+1))
        if flg:
            ok = mid
        else:
            ng = mid
        mid = (ok+ng)//2

    print(ok)


if __name__ == '__main__':
    main()