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,j) for j in range(n)]
    heapify(Q)
    cnt=[0 for _ in range(n)]
    for j in range(n):
        a,c,ind=heappop(Q)
        lv=B[(i+j)%n]//2
        cnt[ind]+=1
        heappush(Q,(a+lv,c+1,ind))
    ans=min(ans,max(cnt))

print(ans)