n=int(input())
A=list(map(int,input().split()))
B=list(map(int,input().split()))

from heapq import heapify,heappop,heappush

inf=float("inf")
ans=inf
for i in range(n):
    Q=[(A[j],0) for j in range(n)]
    heapify(Q)
    max_cnt=0
    for j in range(n):
        a,c=heappop(Q)
        max_cnt=max(max_cnt,c+1)
        heappush(Q,(a+B[(i+j)%n]//2,c+1))
    ans=min(ans,max_cnt)

print(ans)