import heapq

INF = 10 ** 5

n = int(input())
a = list(map(int, input().split()))
b = list(map(int, input().split()))

ans = 1 << 60
for src in range(n):
  hp = []
  for i in range(n):
    heapq.heappush(hp, INF * a[i])

  for i in range(n):
    x = heapq.heappop(hp)
    l, c = x // INF, x % INF
    l += b[(i + src) % n] // 2
    c += 1
    heapq.heappush(hp, l * INF + c)

  cnt = 0
  for x in hp:
    c = x % INF
    cnt = max(cnt, c)

  ans = min(ans, cnt)

print(ans)