#include <bits/stdc++.h>
using namespace std;
template <typename _T>
inline void read(_T &f) {
  f = 0;
  _T fu = 1;
  char c = getchar();
  while (c < '0' || c > '9') {
    if (c == '-') fu = -1;
    c = getchar();
  }
  while (c >= '0' && c <= '9') {
    f = (f << 3) + (f << 1) + (c & 15);
    c = getchar();
  }
  f *= fu;
}
template <typename T>
void print(T x) {
  if (x < 0) putchar('-'), x = -x;
  if (x < 10)
    putchar(x + 48);
  else
    print(x / 10), putchar(x % 10 + 48);
}
template <typename T>
void print(T x, char t) {
  print(x);
  putchar(t);
}
template <typename T>
struct hash_map_t {
  vector<T> v, val, nxt;
  vector<int> head;
  int mod, tot, lastv;
  T lastans;
  bool have_ans;
  hash_map_t(int md = 0) {
    head.clear();
    v.clear();
    val.clear();
    nxt.clear();
    tot = 0;
    mod = md;
    nxt.resize(1);
    v.resize(1);
    val.resize(1);
    head.resize(mod);
    have_ans = 0;
  }
  bool count(int x) {
    int u = x % mod;
    for (register int i = head[u]; i; i = nxt[i]) {
      if (v[i] == x) {
        have_ans = 1;
        lastv = x;
        lastans = val[i];
        return 1;
      }
    }
    return 0;
  }
  void ins(int x, int y) {
    int u = x % mod;
    nxt.push_back(head[u]);
    head[u] = ++tot;
    v.push_back(x);
    val.push_back(y);
  }
  int qry(int x) {
    if (have_ans && lastv == x) return lastans;
    count(x);
    return lastans;
  }
};
const int N = 2e5 + 5;
struct Point {
  long long x, y;
  Point(long long xx = 0, long long yy = 0) : x(xx), y(yy) {}
  Point operator-(const Point A) const { return Point(x - A.x, y - A.y); }
} st[N];
long long s[N], ans, sum;
int a[N];
int n, top;
long long Cross(Point a, Point b) { return a.x * b.y - a.y * b.x; }
long long calc(Point a, int k) { return a.x * k + a.y; }
int main() {
  read(n);
  for (register int i = 1; i <= n; i++)
    read(a[i]), sum += 1ll * a[i] * i, s[i] = s[i - 1] + a[i];
  for (register int i = 1; i <= n; i++) {
    Point now = Point(i, -s[i - 1]);
    while (top >= 2 && Cross(now - st[top - 1], st[top] - st[top - 1]) <= 0)
      --top;
    st[++top] = now;
    int l = 1, r = top;
    while (l < r) {
      int mid = (l + r) >> 1;
      if (calc(st[mid], a[i]) >= calc(st[mid + 1], a[i]))
        r = mid;
      else
        l = mid + 1;
    }
    ans = max(ans, calc(st[l], a[i]) + s[i - 1] - 1ll * a[i] * i);
  }
  top = 0;
  for (register int i = n; i >= 1; i--) {
    Point now = Point(i, -s[i]);
    while (top >= 2 && Cross(now - st[top - 1], st[top] - st[top - 1]) >= 0)
      --top;
    st[++top] = now;
    int l = 1, r = top;
    while (l < r) {
      int mid = (l + r) >> 1;
      if (calc(st[mid], a[i]) >= calc(st[mid + 1], a[i]))
        r = mid;
      else
        l = mid + 1;
    }
    ans = max(ans, calc(st[l], a[i]) + s[i] - 1ll * a[i] * i);
  }
  cout << ans + sum << endl;
  return 0;
}
