/*
* Author: Nonoze
* Created: Monday 07/04/2025
*/
#include <bits/stdc++.h>
using namespace std;
#ifndef DEBUG
#define dbg(...)
#endif
// #define cout cerr << "OUT: "
#define endl '\n'
#define endlfl '\n' << flush
#define quit(x) return (void)(cout << x << endl)
template<typename T> void read(T& x) { cin >> x;}
template<typename T1, typename T2> void read(pair<T1, T2>& p) { read(p.first), read(p.second);}
template<typename T> void read(vector<T>& v) { for (auto& x : v) read(x); }
template<typename T1, typename T2> void read(T1& x, T2& y) { read(x), read(y); }
template<typename T1, typename T2, typename T3> void read(T1& x, T2& y, T3& z) { read(x), read(y), read(z); }
template<typename T1, typename T2, typename T3, typename T4> void read(T1& x, T2& y, T3& z, T4& zz) { read(x), read(y), read(z), read(zz); }
template<typename T> void print(vector<T>& v) { for (auto& x : v) cout << x << ' '; cout << endl; }
#define sz(x) (int)(x.size())
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define make_unique(v) sort(all(v)), v.erase(unique(all(v)), (v).end())
#define pb push_back
#define mp(a, b) make_pair(a, b)
#define fi first
#define se second
#define cmin(a, b) a = min(a, b)
#define cmax(a, b) a = max(a, b)
#define YES cout << "YES" << endl
#define NO cout << "NO" << endl
#define QYES quit("YES")
#define QNO quit("NO")
#define int long long
#define double long double
const int inf = numeric_limits<int>::max() / 4;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
const int MOD = 1e9+7, LOG=20;
void solve();
signed main() {
ios::sync_with_stdio(0);
cin.tie(0);
int tt=1;
// cin >> tt;
while(tt--) solve();
return 0;
}
struct point {
int x, y;
point(int _x=inf, int _y=inf) : x(_x), y(_y) {}
};
int f(point function, int x) {
if (function.x==inf) return inf;
return function.x*x+function.y;
}
struct LiChao {
vector<point> t;
int n;
LiChao(int _n) {
n=_n;
t.resize(n*4);
}
int query(int v, int l, int r, int x) {
int mid=(l+r)/2;
if (l==r) return f(t[v], x);
if (x<=mid) return min(f(t[v], x), query(v*2+1, l, mid, x));
else return min(f(t[v], x), query(v*2+2, mid+1, r, x));
}
void update(int v, int l, int r, point val) {
int mid=(l+r)/2;
bool lef=f(val, l) < f(t[v], l);
bool md=f(val, mid) < f(t[v], mid);
if (md) swap(t[v], val);
if (l==r) return;
if (lef!=md) update(v*2+1, l, mid, val);
else update(v*2+2, mid+1, r, val);
}
int query(int point) {
return query(0, 0, n-1, point);
}
void update(point val) {
update(0, 0, n-1, val);
}
};
int n, k, m, q;
vector<int> h, w;
void solve() {
read(n);
h.clear(), h.resize(n); read(h);
w.clear(), w.resize(n); read(w);
int sum=0;
for (int i=1; i<n; i++) {
sum+=w[i];
w[i]*=-1;
}
LiChao st(1000005); st.update(point(-2*h[0], h[0]*h[0]));
int ans=0;
for (int i=1; i<n; i++) {
int val=st.query(h[i])+h[i]*h[i]+w[i];
ans=val;
st.update(point(-2*h[i], val+h[i]*h[i]));
}
cout << ans+sum << endl;
}
