#include <bits/stdc++.h>
using namespace std;
#define ll long long
const int nx=1e5+5;
ll n, h[nx], w[nx], dp[nx], res, inf=1e18;
bool querymode;
struct line
{
ll m, c;
mutable ll p;
line(ll m=0, ll c=0, ll p=0): m(m), c(c), p(p) {}
bool operator< (const line &o) const {return querymode?p<o.p:m>o.m;}
};
struct convexhulltrick:multiset<line>
{
ll div(ll a, ll b)
{
if ((a%b)==0||(a^b)>=0) return a/b;
return a/b-1;
}
bool isect(iterator x, iterator y)
{
if (y==end()) return x->p=inf, 0;
if (x->m==y->m) x->p=(x->c>=y->c)?-inf:inf;
else x->p=div(y->c-x->c, x->m-y->m);
return x->p>=y->p;
}
void add(line k)
{
auto x=insert(k), y=next(x);
while (isect(x, y)) y=erase(y);
if ((y=x)!=begin()&&isect(--x, y)) isect(x, erase(y));
while ((y=x)!=begin()&&(--x)->p>=y->p) isect(x, erase(y));
}
ll query(ll x)
{
querymode=1;
auto tmp=lower_bound(line(0, 0, x));
querymode=0;
return tmp->m*x+tmp->c;
}
} s;
int main()
{
cin.tie(NULL)->sync_with_stdio(false);
cin>>n;
for (int i=1; i<=n; i++) cin>>h[i];
for (int i=1; i<=n; i++) cin>>w[i], res+=w[i];
dp[1]=-w[1];
s.add(line(h[1], dp[1]+h[1]*h[1], 0));
for (int i=2; i<=n; i++)
{
dp[i]=s.query(-2*h[i])+h[i]*h[i]-w[i];
s.add(line(h[i], dp[i]+h[i]*h[i], 0));
}
cout<<dp[n]+res;
}
/*
6
3 8 7 1 6 6
0 -1 9 1 2 0
*/
