import math
import queue

class zako:
    def __init__(self,level,times):
        self.level=level
        self.times=times

    def __lt__(self,z):
        return self.times+self.level*100000<z.times+z.level*100000

n=int(input())
a=[int(i) for i in input().split()]
bb=[int(i)//2 for i in input().split()]

mini=math.inf
for i in range(n):
    q = queue.PriorityQueue()
    [q.put(zako(i, 0)) for i in a]
    maxi=0
    for j in range(i,n+i):
        z = q.get()
        z.level+=bb[i%n]
        z.times+=1
        if z.times>mini:
            break
        if z.times>maxi:
            maxi=z.times
        q.put(z)
    mini=min(mini,maxi)
print(mini)