import bisect
import copy
import decimal
import fractions
import heapq
import itertools
import math
import random
import sys
from collections import Counter, deque,defaultdict
from functools import lru_cache,reduce
from heapq import heappush,heappop,heapify,heappushpop,_heappop_max,_heapify_max
def _heappush_max(heap,item):
    heap.append(item)
    heapq._siftdown_max(heap, 0, len(heap)-1)
def _heappushpop_max(heap, item):
    if heap and item < heap[0]:
        item, heap[0] = heap[0], item
        heapq._siftup_max(heap, 0)
    return item
from math import gcd as GCD
read=sys.stdin.read
readline=sys.stdin.readline
readlines=sys.stdin.readlines

N=int(readline())
B=list(map(int,readline().split()))
A=list(map(int,readline().split()))
ans=float('inf')
for d in range(N):
    AA=[A[(i+d)%N] for i in range(N)]
    BB=[(B[i],0) for i in range(N)]
    heapify(BB)
    for a in AA:
        b,c=heappop(BB)
        heappush(BB,(b+a//2,c+1))
    ans=min(ans,max(BB[i][1] for i in range(N)))
print(ans)