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

min_max = float('inf')

for k in range(n):
    enemy_order = [B[(k + i) % n] for i in range(n)]
    a = A.copy()
    fight_counts = [0] * n
    
    for b in enemy_order:
        min_level = min(a)
        candidates = [i for i in range(n) if a[i] == min_level]
        
        possible = [i for i in candidates if fight_counts[i] == 0]
        if possible:
            chosen = min(possible)
        else:
            min_fight = min(fight_counts[i] for i in candidates)
            possible = [i for i in candidates if fight_counts[i] == min_fight]
            chosen = min(possible)
        
        exp = b // 2
        a[chosen] += exp
        fight_counts[chosen] += 1
    
    current_max = max(fight_counts)
    if current_max < min_max:
        min_max = current_max

print(min_max)