Product Sum

1000ms

262144K

Description:

Blake is the boss of Kris, however, this doesn't spoil their friendship. They often gather at the bar to talk about intriguing problems about maximising some values. This time the problem is really special.

You are given an array a of length n. The characteristic of this array is the value $\text{[math]}$ — the sum of the products of the values a_i by i. One may perform the following operation exactly once: pick some element of the array and move to any position. In particular, it's allowed to move the element to the beginning or to the end of the array. Also, it's allowed to put it back to the initial position. The goal is to get the array with the maximum possible value of characteristic.

$\text{[math]}$

Input:

The first line of the input contains a single integer n (2 ≤ n ≤ 200 000) — the size of the array a.

The second line contains n integers a_i (1 ≤ i ≤ n, |a_i| ≤ 1 000 000) — the elements of the array a.

Output:

Print a single integer — the maximum possible value of characteristic of a that can be obtained by performing no more than one move.

Sample Input:

4
4 3 2 5

Sample Output:

Sample Input:

5
1 1 2 7 1

Sample Output:

Sample Input:

3
1 1 2

Sample Output:

Note:

In the first sample, one may pick the first element and place it before the third (before 5). Thus, the answer will be 3·1 + 2·2 + 4·3 + 5·4 = 39.

In the second sample, one may pick the fifth element of the array and place it before the third. The answer will be 1·1 + 1·2 + 1·3 + 2·4 + 7·5 = 49.

Informação

Provedor Codeforces

Código CF631E