from heapq import heapify, heappush, heapreplace

def main():
    """ main """
    N = int(input())
    FRIENDS = list(map(int, input().split()))
    ENEMIES = list(map(int, input().split()))

    friends_origin = [(i, 0) for i in FRIENDS]
    max_value = 0
    # # 的の順番ごとに一つ一つ確認していく
    for n in range(N):
        friends = friends_origin[:]
        enemies = ENEMIES[n:] + ENEMIES[:n]
        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()