import math
import copy
from operator import itemgetter
n=int(input())
a=[int(i) for i in input().split()]
b=[int(i) for i in input().split()]
a.sort()
def fun(index):
    array_p=copy.deepcopy(a)
    array=[[i,0] for i in array_p]
    if index==n:
        return math.inf

    for i in range(index,len(b)+index):
        array.sort(key=itemgetter(0))
        j=0
        mini=array[j][1]
        a_index=j
        while array[j][0]==array[j+1][0] and j<n-1:
            if array[j][1]>array[j+1][1]:
                mini=array[j+1][1]
                a_index=j+1
            j+=1
        j=a_index
        #print("array=",array)
        #print("a_index=",a_index)
        array[j][0]+=int(b[i%n]/2)
        array[j][1]+=1

    ret=max(array,key=itemgetter(1))[1]
    #print(index)
    #print(ret)
    return min(ret,fun(index+1))
print(fun(0))