n = int(input())
a = list(map(int, input().split()))
b = list(map(int, input().split()))
d = list(map(int, input().split()))
a.reverse()
b.reverse()
d.sort()
d.append(1<<30)
ans = 0
dp = [0]*(n+1)
for i in range(n+1):
    ndp = [0]*(n+1)
    for j in range(n+1):
        if i+1 <= n:
            ndp[j] = max(ndp[j], dp[j]+(1 if a[i+1]+b[j]>=d[dp[j]] else 0))
        if j+1 <= n:
            dp[j+1] = max(dp[j+1], dp[j]+(1 if a[i]+b[j+1]>=d[dp[j]] else 0))
    ans = max(ans, max(dp[:n+(1 if i != n else 0)]))
    dp = ndp
print(ans)