#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
#define F first
#define S second
ll n,dp[300005],m[300005],x[300005],y[300005];
P dq[300005];
bool check(P a,P b,P c){return (a.F-b.F)*(b.S-c.S)>=(a.S-b.S)*(b.F-c.F);}
int main(void){
	scanf("%lld",&n);
	for(int i=1;i<=n;i++)scanf("%lld",m+i);
	for(int i=1;i<=n;i++)scanf("%lld",x+i);
	for(int i=1;i<=n;i++)scanf("%lld",y+i);
	ll l=0,r=0;
	for(int i=1;i<=n;i++){
		P p=P(-2*x[i],x[i]*x[i]+y[i]*y[i]+dp[i-1]);
		while(r-2>=l&&check(dq[r-2],dq[r-1],p))r--;
		dq[r++]=p;
		while(l+1<r&&dq[l+1].F*m[i]+dq[l+1].S<=dq[l].F*m[i]+dq[l].S)l++;
		dp[i]=m[i]*m[i]+dq[l].F*m[i]+dq[l].S;
	}
	printf("%lld\n",dp[n]);
}