class DualSegmentTree:
    def __init__(self, n, segfunc, ide_ele):
        self.segfunc = segfunc
        self.ide_ele = ide_ele
        self.num = 1 << (n - 1).bit_length()
        self.tree = [ide_ele] * 2 * self.num

    def update(self,l,r,x):
        l += self.num
        r += self.num
        while l < r:
            if l & 1:
                self.tree[l] = self.segfunc(self.tree[l],x)
                l += 1
            if r & 1:
                self.tree[r-1] = self.segfunc(self.tree[r-1],x)
            l >>= 1
            r >>= 1

    def __getitem__(self,idx):
        idx += self.num
        res = self.ide_ele
        while idx:
            res = self.segfunc(res,self.tree[idx])
            idx>>=1
        return res

import sys,random,bisect
from collections import deque,defaultdict
from heapq import heapify,heappop,heappush
from itertools import permutations
from math import log,gcd

input = lambda :sys.stdin.readline().rstrip()
mi = lambda :map(int,input().split())
li = lambda :list(mi())

INF = 10**18

N = int(input())
X = li()
A = li()
M = max(A)

#assert M <= 200

if N==1:
    if A[0]==1:
        print(0)
    else:
        print(-1)
    exit()

dp = [[INF]*(M+3) for p in range(3)]
dp[0][A[0]] = (X[1]-X[0]) * (2 * A[0] - 2)
dp[1][A[0]] = (X[1]-X[0]) * (2 * A[0] - 1)
dp[2][A[0]] = (X[1]-X[0]) * (2 * A[0])

for i in range(1,N-1):
    #ndp = [[INF]*(M+3) for p in range(3)]
    ndp = [DualSegmentTree(M+3,min,INF) for p in range(3)]
    for j in range(1,M+3):
        #端におかない
        if j!=1:
            l = A[i]+j-2*min(A[i],j-1)
            r = min(M+2,A[i]+j)
            for p in range(3):
                ndp[p].update(l,r+1,dp[p][j]+(X[i+1]-X[i])*(p-2))
        
        #片端におく
        
        l = A[i]+j-2*min(A[i],j)+1
        r = min(M+2,A[i]+j)
        for p in range(2):
            ndp[p].update(l,r+1,dp[1][j]+(X[i+1]-X[i])*(p-2))
        for p in range(1,3):
            ndp[p].update(l,r+1,dp[2][j]+(X[i+1]-X[i])*(p-2))
        
        #p2,両端におく
        if 2 <= A[i]:
            l = A[i]+j-2*min(A[i],j+1)+2
            r = min(M+2,A[i]+j)
            for p in range(3):
                ndp[p].update(l,r+1,dp[2][j]+(X[i+1]-X[i])*(p-2))
        
    dp = [[ndp[p][j]+(X[i+1]-X[i])*2*j for j in range(M+3)] for p in range(3)]

res = 10**17
for p in range(3):
    if p <= A[-1]:
        res = min(res,dp[p][A[-1]-p+1])

if res==10**17:
    print(-1)
else:
    print(res)