from heapq import heappushpop, heapify
N=int(input())
A=list(map(int,input().split()))
B=list(map(int,input().split()))*2
def solve(i):
    mask = (1<<15)-1
    q = [x << 15 for x in A]
    heapify(q)
    ret = 0
    for b in B[i:i+N]:
        x=q[0]
        lv,cnt=x>>15,x&mask
        lv+=b//2
        cnt+=1
        if ret<cnt:ret=cnt
        x=(lv<<15)+cnt
        heappushpop(q,x)
    return ret


ans=min(solve(i) for i in range(N))
print(ans)