#include <bits/stdc++.h>

int ri() {
	int n;
	scanf("%d", &n);
	return n;
}

int main() {
	int n = ri();
	int a[n];
	for (auto &i : a) i = ri();
	std::sort(a, a + n);
	int64_t sum[n + 1];
	sum[0] = 0;
	for (int i = 0; i < n; i++) sum[i + 1] = sum[i] + a[i];
	int64_t res = 0;
	for (int i = 0; i < n; i++) {
		int l = -1, r = std::min(n - 1 - i, i);
		while (r - l > 1) {
			int m = l + ((r - l) >> 1);
			if (a[i] - a[i - 1 - m] > a[n - 1 - m] - a[i]) r = m;
			else l = m;
		}
		res = std::max(res, (sum[n] - sum[n - r]) + (sum[i] - sum[i - r]) - (int64_t) a[i] * 2 * r);
		// 
		if (i + 1 < n) {
			int l = -1, r = std::min(n - 2 - i, i);
			double center = (a[i] + a[i + 1]) / 2;
			while (r - l > 1) {
				int m = l + ((r - l) >> 1);
				if (a[i] - center > center - a[i]) r = m;
				else l = m;
			}
			res = std::max(res, (sum[n] - sum[n - r]) + (sum[i] - sum[i - r]) - (int64_t) (a[i] + a[i + 1]) * r);
		}
	}
	std::cout << res << std::endl;
	return 0;
}