#!/usr/bin/env python3

n = int(input())
n += 1
F = 2000000
fs = [0]+list(map(int, input().split()))
ts = list(map(int, input().split()))
mini = 10**18
ps = [fs[i] if fs[i]<fs[i+1] else F-fs[i] for i in range(n-1)]
es = [0]*4

def evaluate():
    global n, F, ps, fs, mini, es, ts
    t = 0
    for i in range(n-1):
        t += min([(ps[i]-(e+t))%F for e in es]) + abs(fs[i+1]-fs[i])+ts[i]
    mini = min(mini, t)

qs = [ps[i]+abs(fs[i+1]-fs[i])+ts[i] for i in range(n-1)]
evaluate()
for i1 in range(n-2):
    es[1] = (es[0]+ps[i1+1]-qs[i1])%F
    for b2 in range(2):
        for i2 in range(n-2):
            es[2] = (es[b2]+ps[i2+1]-qs[i2])%F
            for b3 in range(3):
                for i3 in range(n-2):
                    es[3] = (es[b3]+ps[i3+1]-qs[i3])%F
                    evaluate()

print(mini)