#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <iomanip>
#include <cmath>
#include <stdio.h>
#include <queue>
#include <deque>
#include <cstdio>
#include <set>
#include <map>
#include <bitset>
#include <stack>
#include <cctype>
using namespace std;
long long c[100010];
int main() {
	int n;
	cin >> n;
	for (int i = 0; i < n; i++) {
		cin >> c[i];
	}
	sort(c, c + n);
	long long ans = -10000000000000007;
	long long a = 0, b = 0;
	for (int i = 0; i < n; i++) {
		if (i % 2 == 0) {
			a += c[i];
		}
		else {
			b += c[i];
		}
	}
	if (ans < abs(a) - abs(b)) {
		ans = abs(a) - abs(b);
	}
	a = 0, b = 0;
	for (int i = 0; i < n; i++) {
		if (i != n - i - 1) {
			a += c[i];
			b += c[n - i - 1];
		}
		else {
			a += c[i];
		}
	}
	if (ans < abs(a) - abs(b)) {
		ans = abs(a) - abs(b);
	}
	a = 0, b = 0;
	for (int i = 0; i < n; i++) {
		if (i != n - i - 1) {
			b += c[i];
			a += c[n - i - 1];
		}
		else {
			b += c[i];
		}
	}
	if (ans < abs(a) - abs(b)) {
		ans = abs(a) - abs(b);
	}
	a = 0, b = 0;
	for (int i = n - 1; i >= 0; i--) {
		if (i % 2 == (n - 1) % 2) {
			a += c[i];
		}
		else {
			b += c[i];
		}
	}
	if (ans < abs(a) - abs(b)) {
		ans = abs(a) - abs(b);
	}
	cout << ans << endl;
}