import heapq as hpq
def solve():
	N = int(raw_input())
	ans = N+1
	Q = [(a,0) for a in map(int,raw_input().split())]
	hpq.heapify(Q)
	B = map(int,raw_input().split())
	for i in xrange(N):
		q = Q[:]
		for j in xrange(N):
			lv,cnt = hpq.heappop(q)
			hpq.heappush(q,(lv+B[(i+j)%N]/2,cnt+1))
		ans = min(ans,max(q,key=lambda x:x[1])[1])
	print ans
solve()