from bisect import bisect_left
N = int(input())
A = list(map(int,input().split()))
B = list(map(int,input().split()))
D = list(map(int,input().split()))
D = sorted(D)
M = len(D)
count = 0
dp = [[-1 for _ in range(N+1)] for _ in range(N+1)]
dp[0][0] = 0
for i in range(N+1):
    for j in range(N+1):
        if i == j == 0:
            continue
        k = bisect_left(D,A[i]+B[j])
        if 0 <= k-i-j+1 < M:
            if (D[k-i-j+1]) <= (A[i]+B[j]) and (dp[i-1][j] or dp[i][j-1]):
                dp[i][j] = 1
ans = 0
for i in range(N):
    for j in range(N):
        if dp[i][j] > 0:
            ans = max(i+j+1,ans)
print(ans)