import bisect
N = int(input())
A = [int(a) for a in input().split()]
B = [int(b) for b in input().split()]
D = [int(d) for d in input().split()]

D.sort()
L = [[N]*(N+1) for _ in range(N+1)]
for i in range(N+1):
    for j in range(N+1):
        if i+j > N:
            continue
        c = A[i] + B[j]
        L[i][j] = bisect.bisect_right(D, c)

dp = [[-1]*(N+1) for _ in range(N+1)]
dp[0][0] = N
for i in range(N):
    for j in range(N):
        if i+j >= N:
            continue
        dp[i+1][j] = max(dp[i+1][j], min(L[i+1][j], dp[i][j]) - 1)
        dp[i][j+1] = max(dp[i][j+1], min(L[i][j+1], dp[i][j]) - 1)

ans = 0
for i in range(N+1):
    for j in range(N+1):
        if dp[i][j] < 0 or i+j > N:
            continue
        ans = max(ans, i+j)

print(ans)