import sys

# sys.setrecursionlimit(200005)
int1 = lambda x: int(x)-1
pDB = lambda *x: print(*x, end="\n", file=sys.stderr)
p2D = lambda x: print(*x, sep="\n", end="\n\n", file=sys.stderr)
def II(): return int(sys.stdin.readline())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LI1(): return list(map(int1, sys.stdin.readline().split()))
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]
def SI(): return sys.stdin.readline().rstrip()

dij = [(0, 1), (-1, 0), (0, -1), (1, 0)]
# dij = [(0, 1), (-1, 0), (0, -1), (1, 0), (1, 1), (1, -1), (-1, 1), (-1, -1)]
inf = (1 << 63)-1
# inf = (1 << 31)-1
md = 10**9+7
# md = 998244353

from collections import deque

class ConvexHullTrick:
    def __init__(self, getmin=1, a_inc=0, x_inc=1):
        self._getmin = getmin
        self._a_inc = a_inc
        self._x_inc = x_inc
        self._ab = deque()
        self._inf = (1 << 63)-1
        self._px = self._inf*(-2*x_inc+1)

    def add_line(self, a, b):
        if not self._ab:
            self._ab.append((a, b))
            return
        if self._getmin ^ self._a_inc:
            if self._ab and a == self._ab[-1][0]:
                if (b-self._ab[-1][1])*(self._getmin*2-1) >= 0: return
                self._ab.pop()
            if self._x_inc:
                while len(self._ab) > 1:
                    c, d = self._ab.pop()
                    e, f = self._ab[-1]
                    if (b-d)*(e-c) > (d-f)*(c-a):
                        self._ab.append((c, d))
                        break
            else:
                (c, d), x = self._ab[-1], self._px
                if (a*x+b-c*x-d)*(self._getmin*2-1) >= 0: return
            self._ab.append((a, b))
        else:
            if self._ab and a == self._ab[0][0]:
                if (b-self._ab[0][1])*(self._getmin*2-1) >= 0: return
                self._ab.popleft()
            if not self._x_inc:
                while len(self._ab) > 1:
                    c, d = self._ab.popleft()
                    e, f = self._ab[0]
                    if (b-d)*(e-c) < (d-f)*(c-a):
                        self._ab.append((c, d))
                        break
            else:
                (c, d), x = self._ab[0], self._px
                if (a*x+b-c*x-d)*(self._getmin*2-1) >= 0: return
            self._ab.appendleft((a, b))

    def __getitem__(self, x):
        self._px = x
        if not self._ab: return self._inf*(self._getmin*2-1)
        if self._x_inc:
            while len(self._ab) > 1:
                a, b = self._ab.popleft()
                c, d = self._ab[0]
                if (a*x+b-c*x-d)*(self._getmin*2-1) < 0:
                    self._ab.appendleft((a, b))
                    return a*x+b
        else:
            while len(self._ab) > 1:
                a, b = self._ab.pop()
                c, d = self._ab[-1]
                if (a*x+b-c*x-d)*(self._getmin*2-1) < 0:
                    self._ab.append((a, b))
                    return a*x+b
        a, b = self._ab[0]
        return a*x+b

n = II()
aa = LI()
xx = LI()
yy = LI()

cht = ConvexHullTrick()
mn = 0
for a, x, y in zip(aa, xx, yy):
    cht.add_line(-2*x, x**2+y**2+mn)
    mn = a**2+cht[a]

print(mn)