#include <bits/stdc++.h>
// #include <ext/rope>
// #include <ext/pb_ds/assoc_container.hpp>
// using namespace __gnu_pbds;
// using namespace __gnu_cxx;
using namespace std;
// #define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
#define ll long long
#define ull unsigned long long
#define ld long double
#define pb push_back
#define bit(mask, i) ((mask >> i) & 1)
#define el '\n'
#define F first
#define S second
template <class X, class Y> bool maximize(X &x, const Y &y) { return (x < y ? x = y, 1 : 0); }
template <class X, class Y> bool minimize(X &x, const Y &y) { return (x > y ? x = y, 1 : 0); }
const int INF = 1e9;
const ll LINF = 1e18;
const int MOD = 1e9 + 7;
const int MULTI = 0;
const ld eps = 1e-9;
const int dx[4] = {0, 1, 0, -1}, dy[4] = {1, 0, -1, 0}; // R D L U
const int ddx[4] = {-1, 1, 1, -1}, ddy[4] = {1, 1, -1, -1}; // UR DR DL UL
const char cx[4] = {'R', 'D', 'L', 'U'};
const ll base = 31;
const int nMOD = 2;
const ll mods[] = {(ll)1e9 + 10777, (ll)1e9 + 19777, (ll)1e9 + 3, (ll)1e9 + 3777};
const int N = 1e5 + 5;
const int M = 1e6;
int n, h[N], w[N];
ll p[N], dp[N];
struct line {
ll a, b;
line(ll a = 0, ll b = 0) : a(a), b(b) {}
ll calc(ll x) {
return a * x + b;
}
};
struct LichaoTree {
vector<line> tr;
LichaoTree() {}
LichaoTree(int sz) : tr(4 * sz, line(0, LLONG_MIN)) {}
void update(int id, int l, int r, line f) {
if (l == r) {
tr[id] = (f.calc(l) > tr[id].calc(l) ? f : tr[id]);
return;
}
int mid = (l + r) >> 1;
if (f.calc(mid) > tr[id].calc(mid)) swap(tr[id], f);
if (f.a < tr[id].a)
update(id << 1, l, mid, f);
if (f.a > tr[id].a)
update(id << 1 | 1, mid + 1, r, f);
}
ll query(int id, int l, int r, int pos) {
ll cur = tr[id].calc(pos);
int mid = (l + r) >> 1;
if (l == r) return cur;
if (pos <= mid)
return max(cur, query(id << 1, l, mid, pos));
else
return max(cur, query(id << 1 | 1, mid + 1, r, pos));
}
};
void solve() {
cin >> n;
for (int i = 1; i <= n; ++i)
cin >> h[i];
for (int i = 1; i <= n; ++i)
cin >> w[i], p[i] = p[i - 1] + w[i];
LichaoTree LCT(M);
LCT.update(1, 0, M, line(2 * h[1], p[1] - 1LL * h[1] * h[1]));
for (int i = 2; i <= n; ++i) {
dp[i] = 1LL * h[i] * h[i] + p[i - 1] - LCT.query(1, 0, M, h[i]);
LCT.update(1, 0, M, line(2 * h[i], p[i] - dp[i] - 1LL * h[i] * h[i]));
}
cout << dp[n];
}
signed main() {
ios_base::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
if (!MULTI) solve();
else {
int test; cin >> test;
while (test--) solve();
}
return 0;
}
