from heapq import *

n = int(input())
A = list(map(int, input().split()))
B = list(map(int, input().split()))
A.sort()
ans = 1 << 30
for i in range(n):
    hq = [(a, 0) for a in A]
    max_ = 0
    for j in range(i, i + n):
        if j >= n:
            j -= n
        a, t = heappop(hq)
        t += 1
        a += B[j] // 2
        max_ = max(max_, t)
        heappush(hq, (a, t))
    ans = min(ans, max_)
print(ans)