#include<bits/stdc++.h>
using namespace std;
#define ALL(x) x.begin(),x.end()
#define rep(i,n) for(int i=0;i<(n);i++)
#define debug(v) cout<<#v<<":";for(auto x:v){cout<<x<<' ';}cout<<endl;
#define mod 1000000007
using ll=long long;
const int INF=1000000000;
const ll LINF=1001002003004005006ll;
int dx[]={1,0,-1,0},dy[]={0,1,0,-1};
// ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
template<class T>bool chmax(T &a,const T &b){if(a<b){a=b;return true;}return false;}
template<class T>bool chmin(T &a,const T &b){if(b<a){a=b;return true;}return false;}

struct IOSetup{
    IOSetup(){
        cin.tie(0);
        ios::sync_with_stdio(0);
        cout<<fixed<<setprecision(12);
    }
} iosetup;
 
template<typename T1,typename T2>
ostream &operator<<(ostream &os,const pair<T1,T2>&p){
    os<<p.first<<" "<<p.second;
    return os;
}
 
template<typename T>
ostream &operator<<(ostream &os,const vector<T>&v){
    for(int i=0;i<(int)v.size();i++) os<<v[i]<<(i+1==(int)v.size()?"":" ");
    return os;
}

template<typename T1,typename T2>
istream &operator>>(istream &is,pair<T1,T2>&p){
    is>>p.first>>p.second;
    return is;
}

template<typename T>
istream &operator>>(istream &is,vector<T>&v){
    for(T &x:v)is>>x;
    return is;
}

template<typename T>
struct LiChaoTree{
    struct Line{
        T a,b;
        Line(T a,T b):a(a),b(b){}
        T get(T x)const{return a*x+b;}
        bool over(const Line &b,const T &x){return get(x)<b.get(x);}
    };
 
    vector<T> xs;
    vector<Line> seg;
    int sz;
    LiChaoTree(const vector<T> &x,T INF):xs(x){
        sz=1;
        while(sz<(int)xs.size())sz<<=1;
        while((int)xs.size()<sz)xs.push_back(xs.back()+1);
        seg.assign(2*sz,Line(0,INF));
    }
    void update(Line &x,int k,int l,int r){
        int m=(l+r)/2;
        bool lc=x.over(seg[k],xs[l]),mc=x.over(seg[k],xs[m]);
        if(mc)swap(seg[k],x);
        if(l+1>=r) return ;
        else if(lc!=mc) update(x,2*k,l,m);
        else            update(x,2*k+1,m,r);
    }
    // add ax+b
    void update(T a,T b){
        Line l(a,b);
        update(l,1,0,sz);
    }
    // xs[k]
    T query(int k){
        T x=xs[k];
        k+=sz;
        T ret=seg[k].get(x);
        while(k>1){
            k>>=1;
            chmin(ret,seg[k].get(x));
        }
        return ret;
    }
};



signed main(){
    int n;cin>>n;
    vector<ll> a(n),x(n),y(n);
    cin>>a>>x>>y;


    vector<ll> dp(n+1,0);
    dp[0]=0;

    LiChaoTree<ll> seg(a,LINF);
    seg.update(-2*x[0],dp[0]+x[0]*x[0]+y[0]*y[0]);

    rep(i,n){
        dp[i+1]=seg.query(i)+a[i]*a[i];
        if(i<n-1)seg.update(-2*x[i+1],dp[i+1]+x[i+1]*x[i+1]+y[i+1]*y[i+1]);
    }
    cout<<dp[n]<<endl;
    return 0;
}