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

from bisect import bisect

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

dp = [[-1]*(n+1) for _ in range(n+1)]
dp[0][0] = n
for i in range(n+1):
    for j in range(n+1):
        k = -1
        if i: k = max(k, dp[i-1][j]-1)
        if j: k = max(k, dp[i][j-1]-1)
        if k==-1:continue
        s = aa[i]+bb[j]
        if s < dd[k]: k = bisect(dd, s)-1
        dp[i][j] = k
# p2D(dp)

ans = max(i+j for i in range(n+1) for j in range(n+1) if dp[i][j] != -1)
print(ans)