#include <bits/stdc++.h>
using namespace std;
int main() {
	std::ios_base::sync_with_stdio(false);
	std::cin.tie(nullptr);
	int N;
	cin >> N;
	vector<long> A(N);
	for(int i = 0; i < N; i++) cin >> A[i];
	sort(A.begin(), A.end());
	vector<long> S(N + 1);
	for(int i = 0; i < N; i++) S[i + 1] = S[i] + A[i];
	long ans = 0;
	for(int i = 0; i < N; i++) {
		auto Sum = [&](int x) -> long {
			return S[N]-S[N-x]+S[i]-S[i-x]-A[i]*2*x;
		};
		int maxlen = min(i,N-i-1);
		int l = 0, r = maxlen;
		while(l + 2 < r) {
			int ll = (2*l+r)/3;
			int rr = (l+2*r)/3;
			if(Sum(ll) < Sum(rr)) {
				l = ll;
			} else {
				r = rr;
			}
		}
		for(int i = l; i <= r; i++) ans = max(ans, Sum(i));
	}
	cout << ans << "\n";
}