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.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.io.FilterInputStream;
import java.io.BufferedInputStream;
import java.io.InputStream;

/**
 * @author khokharnikunj8
 */

public class Main {
    public static void main(String[] args) {
        new Thread(null, new Runnable() {
            public void run() {
                new Main().solve();
            }
        }, "1", 1 << 26).start();
    }

    void solve() {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        ScanReader in = new ScanReader(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        CVasyaAndTheMushrooms solver = new CVasyaAndTheMushrooms();
        solver.solve(1, in, out);
        out.close();
    }

    static class CVasyaAndTheMushrooms {
        public void solve(int testNumber, ScanReader in, PrintWriter out) {
            int n = in.scanInt();
            int current_minute = 0;
            int[][] ar = new int[n][2];
            for (int i = 0; i < n; i++) ar[i][0] = in.scanInt();
            for (int i = 0; i < n; i++) ar[i][1] = in.scanInt();
            long[][] prefix = new long[n + 1][2];
            for (int i = n - 1; i >= 0; i--) {
                for (int j = 0; j < 2; j++) {
                    if (i != n - 1) prefix[i][j] += prefix[i + 1][j];
                    prefix[i][j] += ar[i][j];
                }
            }
            long above = 0;
            long below = 0;
            for (int i = 0; i < n; i++) above += ((long) i * ar[i][0]);
            for (int i = n - 1, j = n; i >= 0; i--, j++) above += ((long) j * ar[i][1]);
            for (int i = 0; i < n; i++) below += ((long) i * ar[i][1]);
            for (int i = n - 1, j = n; i >= 0; i--, j++) below += ((long) j * ar[i][0]);
            long ans = -1;
            long current = 0;
            int cc_remove = 0;
            for (int i = 0; i < n; i++) {
                if (i % 2 == 0) {
                    ans = Math.max(ans, current + above);
                    current += (2l * i * ar[i][0]);
                    below -= ((2l * n - 1) * ar[i][0]);
                    ans = Math.max(ans, current + below);
                    above += (prefix[i + 1][0]);
                    above += (prefix[i + 1][1]);
                    below += (prefix[i + 1][1]);
                    below += (prefix[i + 1][0]);
                    above -= ((2l * n - 1) * ar[i][1]);
                    above -= ((2l * i * ar[i][0]));
                    below -= (((2l * i + 1) * ar[i][1]));
                    current += ((2l * i + 1) * ar[i][1]);
                } else {
                    ans = Math.max(ans, current + below);
                    current += (2l * i * ar[i][1]);
                    above -= ((2l * n - 1) * ar[i][1]);
                    ans = Math.max(ans, current + above);
                    above += (prefix[i + 1][0]);
                    above += (prefix[i + 1][1]);
                    below += (prefix[i + 1][1]);
                    below += (prefix[i + 1][0]);
                    below -= ((2l * n - 1) * ar[i][0]);
                    below -= ((2l * i * ar[i][1]));
                    above -= (((2l * i + 1) * ar[i][0]));
                    current += ((2l * i + 1) * ar[i][0]);
                }

            }
            out.println(Math.max(current, ans));
        }

    }

    static class ScanReader {
        private byte[] buf = new byte[4 * 1024];
        private int index;
        private BufferedInputStream in;
        private int total;

        public ScanReader(InputStream inputStream) {
            in = new BufferedInputStream(inputStream);
        }

        private int scan() {
            if (index >= total) {
                index = 0;
                try {
                    total = in.read(buf);
                } catch (Exception e) {
                    e.printStackTrace();
                }
                if (total <= 0) return -1;
            }
            return buf[index++];
        }

        public int scanInt() {
            int integer = 0;
            int n = scan();
            while (isWhiteSpace(n)) n = scan();
            int neg = 1;
            if (n == '-') {
                neg = -1;
                n = scan();
            }
            while (!isWhiteSpace(n)) {
                if (n >= '0' && n <= '9') {
                    integer *= 10;
                    integer += n - '0';
                    n = scan();
                }
            }
            return neg * integer;
        }

        private boolean isWhiteSpace(int n) {
            if (n == ' ' || n == '\n' || n == '\r' || n == '\t' || n == -1) return true;
            else return false;
        }

    }
}

