#include // #include #define int long long #define inf 1000000007 #define pa pair #define ll long long #define pal pair #define ppap pair #define PI 3.14159265358979323846 #define paa pair #define mp make_pair #define pb push_back #define EPS (1e-10) int dx[8]={0,1,0,-1,1,1,-1,-1}; int dy[8]={1,0,-1,0,-1,1,1,-1}; using namespace std; class pa3{ public: int x; int y,z; pa3(int x=0,int y=0,int z=0):x(x),y(y),z(z) {} bool operator < (const pa3 &p) const{ if(x!=p.x) return x (const pa3 &p) const{ if(x!=p.x) return x>p.x; if(y!=p.y) return y>p.y; return z>p.z; //return x != p.x ? x (const pa4 &p) const{ if(x!=p.x) return x>p.x; if(y!=p.y) return y>p.y; if(z!=p.z)return z>p.z; return w>p.w; //return x != p.x ? x (const pa2 &p) const{ return x != p.x ? x struct Segment{ Point p1,p2; }; double dot(Vector a,Vector b){ return a.x*b.x+a.y*b.y; } double cross(Vector a,Vector b){ return a.x*b.y-a.y*b.x; } bool parareru(Point a,Point b,Point c,Point d){ // if(abs(cross(a-b,d-c))b) return gcd(b,v); if(v==b) return b; if(b%v==0) return v; return gcd(v,b%v); } double distans(double x1,double y1,double x2,double y2){ double rr=(x1-x2)*(x1-x2)+(y1-y2)*(y1-y2); return sqrt(rr); } int mod; int extgcd(int a, int b, int &x, int &y) { if (b == 0) { x = 1; y = 0; return a; } int d = extgcd(b, a%b, y, x); y -= a/b * x; return d; } pa operator+(const pa & l,const pa & r) { return {l.first+r.first,l.second+r.second}; } pa operator-(const pa & l,const pa & r) { return {l.first-r.first,l.second-r.second}; } int pr[1200010]; int inv[1200010]; int beki(int wa,int rr,int warukazu){ if(rr==0) return 1%warukazu; if(rr==1) return wa%warukazu; wa%=warukazu; if(rr%2==1) return ((ll)beki(wa,rr-1,warukazu)*(ll)wa)%warukazu; ll zx=beki(wa,rr/2,warukazu); return (zx*zx)%warukazu; } double bekid(double w,int r){ if(r==0) return 1.0; if(r==1) return w; if(r%2) return bekid(w,r-1)*w; double f=bekid(w,r/2); return f*f; } int comb(int nn,int rr){ int r=pr[nn]*inv[rr]; r%=mod; r*=inv[nn-rr]; r%=mod; return r; } void gya(int ert){ pr[0]=1; for(int i=1;i<=ert;i++){ pr[i]=(pr[i-1]*i)%mod; } for(int i=0;i<=ert;i++) inv[i]=beki(pr[i],mod-2,mod); } // cin.tie(0); // ios::sync_with_stdio(false); //priority_queue,greater> pq; //sort(ve.begin(),ve.end(),greater()); //----------------kokomade tenpure------------ struct convex_hull{ // 1 // 2 3 // 4 5 6 7 struct line{ int a; int b; }; /* typedef struct node{ int l; int r; // 閉区間!! int line_id; node* l_c; node* r_c; }node; */ private: public: /* node* new_node(int l,int r,int line_id){ node* v=new node(); v->l=l; v->r=r; v->line_id=line_id; return v; } */ int f(line s,int x){ return s.a*x+s.b; } // (1<<15)=32768 // 1<<16 = 65536 // 1<<17 = 131072 // 1<<18 = 262144 int inff=inf*2000000000ll*2ll; int n; int cor=1; vector lines; vector points; vector vec; map point_to_id; void add_pos(int x){ points.pb(x); } void shoki(){ // cout<=vec[id].y && p3>=vec[id].w) break; if(p1<=vec[id].y && p3<=vec[id].w){ vec[id]={line_id,p1,p2,p3}; break; } if(p2<=vec[id].z){ swap(vec[id].x,line_id); swap(vec[id].y,p1); swap(vec[id].z,p2); swap(vec[id].w,p3); } if(id>=cor)break; if(p1<=vec[id].y){ id=2*id; r=m; } else if(p3<=vec[id].w){ id=2*id+1; l=m; } else assert(0); } } }; int dp[300020]; int a[300030]; int x[300030]; int y[300030]; convex_hull ss; signed main(){ cin.tie(0); ios::sync_with_stdio(false); int n; cin>>n; for(int i=1;i<=n;i++)cin>>a[i]; for(int i=1;i<=n;i++)cin>>x[i]; for(int i=1;i<=n;i++)cin>>y[i]; dp[0]=0; for(int i=1;i<=n;i++){ // cin>>d[i]; ss.add_pos(a[i]); } ss.shoki(); for(int i=1;i<=n;i++){ int j=i; ss.add_line(-2*x[j],y[j]*y[j]+x[j]*x[j]+dp[j-1]); dp[i]=ss.getmin(a[i])+a[i]*a[i]; //cout<