import heapq
N = int(input())
A = list(map(int, input().split()))
B = list(map(int, input().split())) * 2

ans = 0
for i in range(N):
    P = [(a, 0) for a in A]
    heapq.heapify(P)
    for j in range(N):
        a, c = heapq.heappop(P)
        a += B[i+j]//2
        c += 1
        heapq.heappush(P, (a, c))
    score = min(c for _, c in P)
    ans = max(ans, score)

print(ans)