from heapq import heappop,heappush
def Check(N, L, heap, x):
    ret = 0
    heap2 = []
    for i in range(N):
        if not heap2:
            P = heap[0][0]
            while P == heap[0][0]:
                Level,cnt = heappop(heap)
                heappush(heap2, (cnt, Level))
        cnt, Level = heappop(heap2)
        Level += L[(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()))
heap = []
for i in range(N):
    heappush(heap, (A[i], 0))
    B[i] //= 2
ans = 1<<32
for i in range(N):
    ans = min(ans, Check(N, B, heap, i))
print(ans)