#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
//using mint = modint998244353;
//const int mod = 998244353;
//const int INF = 1e9;
const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n-1); i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r-1);i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define endl "\n"
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }

int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int n; cin >> n;
	vector<long long>a(n), sa(n + 1);
	rep(i, n)cin >> a[i];
	sort(all(a));
	rep(i, n)sa[i + 1] = sa[i] + a[i];
	long long ans = -LINF;
	rep(i, n) {
		long long c = a[i];
		int ok = 0;
		int ng = min(i, n - i - 1) + 1;
		while (1 < abs(ok - ng)) {
			int mid = (ng + ok) / 2;
			auto check = [&]() {
				return a[n - mid] + a[i - mid] - c * 2 >= 0;
			};
			if (check()) ok = mid;
			else ng = mid;
		}
		long long val = 0;
		val += sa[n] - sa[n - ok];
		val += sa[i] - sa[i - ok];
		val -= c * ok * 2;
		chmax(ans, val);
	}
	cout << ans << endl;
	return 0;
}