#include<bits/stdc++.h>
typedef long long ll;
#define pb push_back
#define mp make_pair
#define fi first
#define se second
using namespace std;
ll n,i,a[101010],p[101010],d[101010],w[101010],b[101010],j,has;
priority_queue<pair<ll,ll> > pq[44];
ll depe(ll aa)
{
if(aa==n)return 0;
if(!b[aa])
{
b[aa]=1;
d[aa]=1e18;
ll ii;
for(ii=aa+1;ii<=n;ii++)
d[aa]=min(d[aa],depe(ii)+p[ii-1]-p[aa]+(a[aa]-a[ii])*(a[aa]-a[ii]));
}
return d[aa];
}
int main()
{
ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
cin>>n;
for(i=1;i<=n;i++)cin>>a[i];
for(i=1;i<=n;i++)cin>>w[i];
for(i=1;i<=n;i++)p[i]=p[i-1]+w[i];
if(1)
{
has=(a[1]-a[n])*(a[1]-a[n])+p[n-1]-p[1];
for(i=3;i<n;i++)
pq[w[i]+20].push(mp(a[i],i));
for(i=2;i<n;i++)
has=min(has,(a[1]-a[i])*(a[1]-a[i])+(a[i]-a[n])*(a[i]-a[n])+p[n-1]-p[i]+p[i-1]-p[1]);
//cout<<has<<"\n";return 0;
for(i=2;i<n;i++)
{
ll hz=(a[1]-a[i])*(a[1]-a[i]);
for(j=-20;j<=20;j++)
{
while((!pq[j+20].empty())&&(pq[j+20].top().se<=i))pq[j+20].pop();
if(pq[j+20].empty())continue;
has=min(has,hz+(a[i]-j)*(a[i]-j)+(a[n]-j)*(a[n]-j)+p[n-1]-p[i]-pq[j+20].top().fi);
}
// cout<<hz<<" "<<has<<"\n";
}
cout<<has<<"\n";
}
else
{
cout<<depe(1)<<"\n";
}
}
