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()]
b=[int(i) for i in input().split()]

def fun(index):
    q=queue.PriorityQueue()
    for i in a:
        q.put(zako(i,0))

    if index==n:
        return math.inf

    maxi=0

    for i in range(index,n+index):
        z=q.get()
        z.level+=int(b[i%n]/2)
        z.times+=1
        if z.times>maxi: maxi=z.times
        q.put(z)


    #print(index)
    #print(ret)
    return min(maxi,fun(index+1))
print(fun(0))