INF = 10 ** 9
MOD = 10 **9 + 7
import sys
sys.setrecursionlimit(100000000)
dy = (-1,0,1,0)
dx = (0,1,0,-1)
from heapq import heapify,heappop,heappush

def main():
    n = int(input())
    a = list(map(int,input().split()))
    a.sort()
    cuml = [0] * (n + 1)
    cumr = [0] * (n + 1)
    for i in range(n):
        cuml[i + 1] = cuml[i] + a[i]
    for i in range(n - 1,-1,-1):
        cumr[i] = cumr[i + 1] + a[i]
    
    ans = -INF
    for i in range(n//2):
        ans = max(ans,cuml[i + 1] + cumr[n - i] - a[i]*(2*i + 1))
    for i in range(n//2,n):
        ans = max(ans,cumr[2*i - n + 1] - a[i]*(2*n - 2*i - 1))
    
    for i in range(1,(n + 1)//2):
        ans = max(ans,cuml[i + 1] + cumr[n - i + 1] - (a[i] + a[i - 1])*i)
    for i in range((n + 1)//2,n):
        ans = max(ans,cumr[2*i - n] - (a[i] + a[i - 1])*(n - i))
    print(ans)
if __name__=='__main__':
    main()