import heapq

n = int(input())
a_ls = [int(a) for a in input().split()]
b_ls = [int(b) for b in input().split()]

hq_o = [(a, 0) for a in a_ls]
heapq.heapify(hq_o)

db_ls = b_ls + b_ls

ct_max_min = n
for i in range(n):
    hq = hq_o[:]
    
    ct_max = 0
    for j in range(n):
        lv, ct = hq[0]
        lv += db_ls[i + j] // 2
        ct += 1
        heapq.heapreplace(hq, (lv, ct))
        if ct > ct_max:
            ct_max = ct
        
        if ct_max >= ct_max_min:
            break

    if ct_max < ct_max_min:
        ct_max_min = ct_max

print(ct_max_min)