N = int(input())
parties = list(map(int, input().split()))
monsters = list(map(int, input().split()))

maximum = 0
for i in range(N):
    k = i
    battles = [0 for i in range(N)]
    b_parties = parties.copy()
    for j in range(N):
        idx = b_parties.index(min(b_parties))
        min_party = min(b_parties)

        min_party += (monsters[k] // 2)
        b_parties[idx] = min_party
        battles[idx] += 1
        k += 1
        if k >= N:
            k = 0
            
    if maximum < max(battles):
        maximum = max(battles)
        
print(maximum)