#include <bits/stdc++.h> using namespace std; #define modulo 1000000007 #define mod(mod_x) ((((long long)mod_x+modulo))%modulo) #define Inf 10000000000000000 int main(){ int N; cin>>N; vector<long long> a(N); for(int i=0;i<N;i++){ cin>>a[i]; } sort(a.begin(),a.end()); vector<long long> S(N+1,0); for(int i=0;i<N;i++){ S[i+1] = a[i]; S[i+1] += S[i]; } long long ans = 0; for(int i=1;i<N-1;i++){ int ok = 0; int ng = min(i,N-i-1)+1; while(ng-ok>1){ int mid = (ok+ng)/2; if(a[i-mid]+a[N-mid]-2*a[i]>0)ok=mid; else ng=mid; } ans = max(ans,S[i]-S[i-ok]+S[N]-S[N-ok]-a[i]*(2*ok)); } cout<<ans<<endl; return 0; }