#include<bits/stdc++.h>
#define int long long
using namespace std;

const int N=3e5+5;
int n,a[N],x[N],y[N],dp[N],q[N],pos[N],head,tail;

int cube(int v){
    return v*v*v;
}

int calc(int i,int j){
    return dp[j-1]+cube(llabs(a[i]-x[j]))+cube(llabs(y[j]));
}

int getPos(int j1,int j2){
    int l=j2,r=n+1;
    while(l<r){
        int mid=(l+r)>>1;
        if(calc(mid,j2)<=calc(mid,j1)) r=mid;
        else l=mid+1;
    }
    return l;
}

signed main(){
    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];
    head=tail=dp[0]=0;
    for(int i=1;i<=n;i++){
        while(head<tail){
            int j=q[tail-1],p=getPos(j,i);
            if(p<=pos[tail-1]) tail--;
            else{
                q[tail]=i;
                pos[tail]=p;
                tail++;
                break;
            }
        }
        if(head==tail){
            q[tail]=i;
            pos[tail]=1;
            tail++;
        }
        while(head+1<tail&&pos[head+1]<=i) head++;
        int j=q[head];
        dp[i]=calc(i,j);
    }
    cout<<dp[n];
    return 0;
}