n = int(input())
A = list(map(int, input().split()))
B = list(map(int, input().split()))

best = float('inf')

for k in range(n):
    rotated_B = B[k:] + B[:k]
    current_A = A.copy()
    selected = [0] * n
    current_min = min(current_A)
    for b in rotated_B:
        candidates = []
        for i in range(n):
            if current_A[i] == current_min:
                candidates.append(i)
        unselected = [i for i in candidates if selected[i] == 0]
        if unselected:
            chosen = min(unselected)
        else:
            chosen = min(candidates)
        selected[chosen] += 1
        add = b // 2
        current_A[chosen] += add
        old_level = current_A[chosen] - add
        if old_level == current_min:
            current_min = min(current_A)
    current_max = max(selected)
    if current_max < best:
        best = current_max

print(best)