B"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 -- the sum of the products of the values ai 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. The first line of the input contains a single integer n (2 xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89n xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89200 xe2 x80 x89000) -- the size of the array a. The second line contains n integers ai (1 xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89i xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89n, |ai| xe2 x80 x89 xe2 x89 xa4 xe2 x80 x891 xe2 x80 x89000 xe2 x80 x89000) -- the elements of the array a. Print a single integer -- the maximum possible value of characteristic of a that can be obtained by performing no more than one move. In the first sample, one may pick the first element and place it before the third (before 5). Thus, the answer will be 3 xc2 xb71 xe2 x80 x89+ xe2 x80 x892 xc2 xb72 xe2 x80 x89+ xe2 x80 x894 xc2 xb73 xe2 x80 x89+ xe2 x80 x895 xc2 xb74 xe2 x80 x89= xe2 x80 x8939. In the second sample, one may pick the fifth element of the array and place it before the third. The answer will be 1 xc2 xb71 xe2 x80 x89+ xe2 x80 x891 xc2 xb72 xe2 x80 x89+ xe2 x80 x891 xc2 xb73 xe2 x80 x89+ xe2 x80 x892 xc2 xb74 xe2 x80 x89+ xe2 x80 x897 xc2 xb75 xe2 x80 x89= xe2 x80 x8949."...