from copy import deepcopy
from heapq import heappop,heappush
def f(x):
    heap = deepcopy(H)
    ret = 0
    for i in range(N):
        level,cnt = heappop(heap)
        level += B[(x+i)%N]
        cnt += 1
        ret = max(ret, cnt)
        heappush(heap, (level, cnt))
    return ret

N = int(input())
A = list(map(int,input().split()))
B = list(map(int,input().split()))
H = []
for i in range(N):
    heappush(H, (A[i], 0))
    B[i] //= 2
ans = 1<<32
for i in range(N):
    ans = min(ans, f(i))
print(ans)