#!/usr/bin/env python3
N = int(input())
A = list(map(int, input().split()))
B = list(map(int, input().split()))
key = lambda x: A[x] * 1501 + won[x]
mintimes = float("inf")
for i in range(-(N - 1), -1):
    won = [0] * N
    for j in range(i, i + N):
        monster = min(range(N), key=key)
        A[monster] += B[j] // 2
        won[monster] += 1
    mintimes = min(mintimes, max(won))
print(mintimes)