from heapq import heapify, heappush, heapreplace
from collections import deque

def main():
    """ main """
    N = int(input())
    FRIENDS = [[i, 0] for i in list(map(int, input().split()))]
    ENEMIES = list(map(int, input().split()))

    max_value = 0
    enemies = deque(ENEMIES[:])
    # # 的の順番ごとに一つ一つ確認していく
    for n in range(N):
        friends = FRIENDS[:]
        enemies.rotate()
        for enemy in enemies:
            lv, cnt = friends[0]
            heapreplace(friends, [lv+enemy//2, cnt+1])
        max_value = max(max_value, max(cnt for lv, cnt in friends))

    print(max_value)

main()