#include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) begin(v),end(v)
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; }
using ll = long long;
using pii = pair<int, int>;
constexpr ll INF = 1ll<<30;
constexpr ll longINF = 1ll<<60;
constexpr ll MOD = 1000000007;
constexpr bool debug = false;
//---------------------------------//

int main() {
	int N;
	cin >> N;
	vector<int> A(N);
	REP(i, N) scanf("%d", &A[i]);
	sort(ALL(A));
	
	ll sum = accumulate(ALL(A), 0ll);
	
	ll ans = -longINF;
	REP(i, 2) {
		ll a = accumulate(A.begin(), A.begin() + (N + 1) / 2, 0ll);
		ll cur = abs(a) - abs(sum - a);
		
		a = 0;
		for (int j = 0; j < N; j += 2) a += A[j];
		chmin(cur, abs(a) - abs(sum - a));
		chmax(ans, cur);
		
		reverse(ALL(A));
	}
	cout << ans << endl;
}