6
12 8 12 17 20 5
17 4 8 8 8 4
 6
4 1 12 9 3 11
12 20 19 12 19 11
 1
1
1
 2
1 2
1 1
 1
7
5
 6
16 20 18 7 14 2
17 12 4 10 7 4

705
 917
 1
 9
 5
 741

import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.io.*;
import java.util.*;
import java.util.LinkedList;
import java.math.*;
import java.lang.*;
import java.util.PriorityQueue;
import static java.lang.Math.*;
@SuppressWarnings("unchecked")
public class solution implements Runnable {
    static class InputReader {
        private InputStream stream;
        private byte[] buf = new byte[1024];
        private int curChar;
        private int numChars;
        private SpaceCharFilter filter;
        private BufferedReader br = new BufferedReader(new InputStreamReader(System.in));

        public InputReader(InputStream stream) {
            this.stream = stream;
        }
        
        public int read() {
            if (numChars==-1) 
                throw new InputMismatchException();
            
            if (curChar >= numChars) {
                curChar = 0;
                try {
                    numChars = stream.read(buf);
                }
                catch (IOException e) {
                    throw new InputMismatchException();
                }
                
                if(numChars <= 0)               
                    return -1;
            }
            return buf[curChar++];
        }
     
        public String nextLine() {
            String str = "";
            try {
                str = br.readLine();
            }
            catch (IOException e) {
                e.printStackTrace();
            }
            return str;
        }
        public int nextInt() {
            int c = read();
            
            while(isSpaceChar(c)) 
                c = read();
            
            int sgn = 1;
            
            if (c == '-') {
                sgn = -1;
                c = read();
            }
            
            int res = 0;
            do {
                if(c<'0'||c>'9') 
                    throw new InputMismatchException();
                res *= 10;
                res += c - '0';
                c = read();
            }
            while (!isSpaceChar(c)); 
            
            return res * sgn;
        }
        
        public long nextLong() {
            int c = read();
            while (isSpaceChar(c))
                c = read();
            int sgn = 1;
            if (c == '-') {
                sgn = -1;
                c = read();
            }
            long res = 0;
            
            do {
                if (c < '0' || c > '9')
                    throw new InputMismatchException();
                res *= 10;
                res += c - '0';
                c = read();
            }
            while (!isSpaceChar(c));
                return res * sgn;
        }
        
        public double nextDouble() {
            int c = read();
            while (isSpaceChar(c))
                c = read();
            int sgn = 1;
            if (c == '-') {
                sgn = -1;
                c = read();
            }
            double res = 0;
            while (!isSpaceChar(c) && c != '.') {
                if (c == 'e' || c == 'E')
                    return res * Math.pow(10, nextInt());
                if (c < '0' || c > '9')
                    throw new InputMismatchException();
                res *= 10;
                res += c - '0';
                c = read();
            }
            if (c == '.') {
                c = read();
                double m = 1;
                while (!isSpaceChar(c)) {
                    if (c == 'e' || c == 'E')
                        return res * Math.pow(10, nextInt());
                    if (c < '0' || c > '9')
                        throw new InputMismatchException();
                    m /= 10;
                    res += (c - '0') * m;
                    c = read();
                }
            }
            return res * sgn;
        }
        
        public String readString() {
            int c = read();
            while (isSpaceChar(c))
                c = read();
            StringBuilder res = new StringBuilder();
            do {
                res.appendCodePoint(c);
                c = read();
            } 
            while (!isSpaceChar(c));
            
            return res.toString();
        }
     
        public boolean isSpaceChar(int c) {
            if (filter != null)
                return filter.isSpaceChar(c);
            return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
        }
     
        public String next() {
            return readString();
        }
        
        public interface SpaceCharFilter {
            public boolean isSpaceChar(int ch);
        }
    }
	public static int min(int a,int b)
	{
		if(a>b)
		{
			return b;
		}
		return a;
	}
	public static long max(long a,long b)
	{
		if(a>b)
		{
			return a;
		}
		return b;
	}
	static class pair implements Comparable<pair>
	{
		int x;
		int y;
		pair(int x,int y)
		{
			this.x = x;
			this.y = y;
		}
		public int compareTo(pair p)
		{
			if(this.x>p.x)
			{
				return 1;
			}
			else if(this.x<p.x)
			{
				return -1;
			}
			else
			{
				return this.y-p.y;
			}
		}
	}
	public static void main(String args[]) throws Exception {
        new Thread(null, new solution(),"Main",1<<26).start();
    }
	public void run() {
        InputReader sc  = new InputReader(System.in);
		PrintWriter out = new PrintWriter(System.out);
		int t1 = 1;
		while(t1-->0)
		{
			int n = sc.nextInt();
			long[][] arr = new long[2][n];
			for(int j=0;j<2;j++)
			{
				for(int i=0;i<n;i++)
				{
					arr[j][i] = sc.nextInt();
				}
			}
			long[][] suffix1 = new long[2][n+1];
			long[][] suffix2 = new long[2][n+1];
			long[][] sum = new long[2][n+1];
			for(int i=n-1;i>=0;i--)
			{
				suffix1[0][i] = suffix1[0][i+1]+(i+1)*arr[0][i];
				suffix1[1][i] = suffix1[1][i+1]+(i+1)*arr[1][i];
				suffix2[0][i] = suffix2[0][i+1]+(n-i)*arr[0][i];
				suffix2[1][i] = suffix2[1][i+1]+(n-i)*arr[1][i];
				sum[0][i] = sum[0][i+1]+arr[0][i];
				sum[1][i] = sum[1][i+1]+arr[1][i];
			}
			long res = 0;
			long sm = 0;
			int j = 0;
			for(int i=0;i<n;i++)
			{
				long curr = sm;
				curr+=suffix1[j][i]+i*sum[j][i];
				curr+=suffix2[j^1][i]+(i+n)*sum[j^1][i];
				res = max(res,curr);
				sm+=arr[j][i]*(2*i+1);
				sm+=arr[j^1][i]*(2*i+2);
				j = j^1;
			}
			for(int i=0;i<n;i++)
			{
				res-=arr[0][i]+arr[1][i];
			}
			out.println(res);
		}
		out.close();
    }
}