import sys
input = sys.stdin.readline
from heapq import *
from collections import deque

def main():
	n = int(input())
	ans = 1 << 30
	p = [l * 1510 for l in map(int, input().split())]
	heapify(p)
	enemies = deque(map(int, input().split()))
	for _ in range(n):
		party = p[:]
		for el in enemies:
			x = heappop(party)
			heappush(party, (x // 1510 + el // 2) * 1510 + x % 1510 + 1)
		ans = min(ans, max(x % 1510 for x in party))
		enemies.rotate(1)
	print(ans)

if __name__ == "__main__":
	main()