#include <bits/stdc++.h>
using namespace std;
const int maxN = 1e6 + 10;
priority_queue<int> P;
priority_queue<int, vector<int>, greater<int> > mP;
long long gcd(long long a, long long b) {
  if (b == 0)
    return a;
  else
    return gcd(b, a % b);
}
int mod = 1000 * 1000 * 1000 + 7;
long long ksm(int a, int b) {
  if (b == 0) return 1LL;
  long long ret = 1, pp = a;
  while (b) {
    if (b % 2 == 1) {
      ret *= pp;
      ret %= mod;
    }
    b /= 2;
    pp = pp * pp % mod;
  }
  return ret;
}
int bit[maxN];
int lowbit(int x) { return x & (-x); }
void update(int i, int v) {
  while (i < maxN) {
    bit[i] += v;
    i += lowbit(i);
  }
}
int getsum(int i) {
  int x = 0;
  while (i > 0) {
    x += bit[i];
    i -= lowbit(i);
  }
  return x;
}
void change(int a, int b, int k) {
  update(a, k);
  update(b + 1, -k);
}
int father[maxN];
void init(int n) {
  for (int i = 1; i <= n; i++) father[i] = i;
  return;
}
int find(int v) {
  if (father[v] == v)
    return v;
  else
    return father[v] = find(father[v]);
}
void merge(int v, int u) {
  int t1 = find(v);
  int t2 = find(u);
  father[t2] = t1;
  return;
}
long long hashing(string s) {
  long long ans[2] = {1, 1};
  int p[2] = {402653189, 1610612741};
  for (int j = 0; j < 2; j++) {
    for (int i = 0; i < s.size(); i++) {
      ans[j] = ((ans[j] * 257) + s[i] - 'a') % p[j];
    }
  }
  return ans[0] * 2e10 + ans[1];
}
long long v[maxN][2];
long long dp[maxN][2];
long long dp2[maxN][2];
long long ss[maxN];
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  int n;
  cin >> n;
  for (int i = 0; i < n; i++) {
    cin >> v[i][0];
  }
  for (int i = 0; i < n; i++) {
    cin >> v[i][1];
  }
  int cnt = 0;
  for (int i = 0; i < n; i++) {
    if (i % 2 == 0) {
      for (int j = 0; j < 2; j++) {
        if (i == 0 && j == 0) continue;
        cnt++;
        if (i % 2 == j) {
          dp[i][j] = dp[i - 1][j] + cnt * v[i][j];
        } else {
          dp[i][j] = dp[i][1 - j] + cnt * v[i][j];
        }
      }
    } else {
      for (int j = 1; j >= 0; j--) {
        cnt++;
        if (i % 2 == j) {
          dp[i][j] = dp[i - 1][j] + cnt * v[i][j];
        } else {
          dp[i][j] = dp[i][1 - j] + cnt * v[i][j];
        }
      }
    }
  }
  dp2[n - 1][0] = v[n - 1][1];
  dp2[n - 1][1] = v[n - 1][0];
  for (int i = n - 1; i >= 0; i--) {
    ss[i] = ss[i + 1] + v[i][0] + v[i][1];
  }
  for (int i = n - 2; i >= 0; i--) {
    for (int j = 0; j <= 1; j++) {
      dp2[i][j] =
          dp2[i + 1][j] + ss[i + 1] + v[i][1 - j] * 1LL * (2 * n - 2 * i - 1);
    }
  }
  long long fans = 0;
  for (int i = 0; i < n; i++) {
    long long tmp;
    if (i > 0 && i < n - 1) {
      tmp = dp[i - 1][i % 2] + (i * 2LL) * ss[i] + dp2[i][i % 2];
    } else if (i == n - 1) {
      tmp = dp[i][1 - i % 2];
    } else {
      tmp = dp2[0][0];
    }
    if (fans < tmp) fans = tmp;
  }
  cout << fans << endl;
  return 0;
}
