#include <bits/stdc++.h>
using namespace std;
typedef long double ld;
typedef long long ll;
const ll INF = (ll) 1e18 + 7;
struct T {
ll a;
ll b;
bool mt = 1;
ll evaluate(ll x) {
if (mt) {
return INF;
}
return a * x + b;
}
};
const int N = (int) 1e5 + 7;
int n;
ll h[N];
ll sum[N];
ll dp[N];
T coef[N];
signed main() {
ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
cin >> n;
for (int i = 1; i <= n; i++) {
int x;
cin >> x;
h[i] = x;
}
for (int i = 1; i <= n; i++) {
int x;
cin >> x;
sum[i] = sum[i - 1] + x;
}
dp[1] = 0;
for (int i = 2; i <= n; i++) {
dp[i] = INF;
}
vector<T> all;
for (int r = 2; r <= n; r++) {
T line = {- 2 * h[r - 1], dp[r - 1] + h[r - 1] * h[r - 1] - sum[r - 1]};
line.mt = 0;
all.push_back(line);
ll x = h[r];
for (auto &ln : all) {
dp[r] = min(dp[r], ln.a * x + ln.b);
}
dp[r] += h[r] * h[r] + sum[r - 1];
}
cout << dp[n] << "\n";
}
