import java.io.*;
import java.util.*;


class Main {
    static long sq(long x){return x*x;}
    static int cur=0;
    static int t=0;
    static long[][]line;
    static boolean compact(){
        if(t<=2)return false;
        long[]a=line[0];
        long[]b=line[1];
        long fst=a[t-1]*b[t-3]-a[t-3]*b[t-1];
        long snd=(a[t-1]-a[t-3])*b[t-2]-a[t-2]*(b[t-1]-b[t-3]);
        if(fst>=snd){
            a[t-2]=a[t-1];
            b[t-2]=b[t-1];
            t--;
            if(cur>=t)cur=t-1;
            return true;
        }
        return false;
    }
    public static void main(String[] args) {
        MyScanner sc = new MyScanner();
        out = new PrintWriter(new BufferedOutputStream(System.out));
        int n=sc.nextInt();
        int[]a=sc.nextIntArray(n);
        int[]x=sc.nextIntArray(n);
        int[]y=sc.nextIntArray(n);
        long[]dp=new long[n+1];
        long[]aux=new long[n+1];
        line=new long[2][n+1];
        for(int i=0;i<=n;++i){
            // query: get the minimum
            if(i>0){
                long curX=a[i-1];
                while(cur<t-1&&line[0][cur]*curX+line[1][cur]>line[0][cur+1]*curX+line[1][cur+1])cur++;
                dp[i]=line[0][cur]*curX+line[1][cur]+sq(curX);
            }
            // update: add a line
            if(i<n){
                aux[i]=dp[i]+sq(x[i])+sq(y[i]);
                long grad=-2*x[i];
                line[0][t]=grad;
                line[1][t]=aux[i];
                t++;
                while(compact());
            }
            if(false){
                System.err.println("grad: "+Arrays.toString(Arrays.copyOf(line[0],t)));
                System.err.println("seg: "+Arrays.toString(Arrays.copyOf(line[1],t)));
            }
        }
        // System.err.println("dp="+Arrays.toString(dp));
        out.println(dp[n]);
        out.close();
    }
    // http://codeforces.com/blog/entry/7018
    //-----------PrintWriter for faster output---------------------------------
    public static PrintWriter out;
    //-----------MyScanner class for faster input----------
    public static class MyScanner {
        BufferedReader br;
        StringTokenizer st;
        public MyScanner() {
            br = new BufferedReader(new InputStreamReader(System.in));
        }
        String next() {
            while (st == null || !st.hasMoreElements()) {
                try {
                    st = new StringTokenizer(br.readLine());
                } catch (IOException e) {
                    e.printStackTrace();
                }
            }
            return st.nextToken();
        }
        int nextInt() {
            return Integer.parseInt(next());
        }
        long nextLong() {
            return Long.parseLong(next());
        }
        double nextDouble() {
            return Double.parseDouble(next());
        }
        String nextLine(){
            String str = "";
            try {
                str = br.readLine();
            } catch (IOException e) {
                e.printStackTrace();
            }
            return str;
        }
        int[] nextIntArray(int n){
            int[]r=new int[n];
            for(int i=0;i<n;++i)r[i]=nextInt();
            return r;
        }
    }
}