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

min_max = float('inf')

for k in range(n):
    order = B[k:] + B[:k]
    state = [[a, 0] for a in A]
    max_count = 0
    for b in order:
        min_level = min(s[0] for s in state)
        candidates = [i for i in range(n) if state[i][0] == min_level]
        zero_selected = [i for i in candidates if state[i][1] == 0]
        if zero_selected:
            selected = min(zero_selected)
        else:
            min_cnt = min(state[i][1] for i in candidates)
            min_cnt_candidates = [i for i in candidates if state[i][1] == min_cnt]
            selected = min(min_cnt_candidates)
        state[selected][0] += b // 2
        state[selected][1] += 1
        if state[selected][1] > max_count:
            max_count = state[selected][1]
    if max_count < min_max:
        min_max = max_count

print(min_max)