#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,m,n) for(int i=(m);i<(n);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
using ll = long long;
constexpr int INF = 0x3f3f3f3f;
constexpr long long LINF = 0x3f3f3f3f3f3f3f3fLL;
constexpr double EPS = 1e-8;
constexpr int MOD = 1000000007;
// constexpr int MOD = 998244353;
constexpr int dy[] = {1, 0, -1, 0}, dx[] = {0, -1, 0, 1};
constexpr int dy8[] = {1, 1, 0, -1, -1, -1, 0, 1}, dx8[] = {0, -1, -1, -1, 0, 1, 1, 1};
template <typename T, typename U> inline bool chmax(T &a, U b) { return a < b ? (a = b, true) : false; }
template <typename T, typename U> inline bool chmin(T &a, U b) { return a > b ? (a = b, true) : false; }
struct IOSetup {
  IOSetup() {
    std::cin.tie(nullptr);
    std::ios_base::sync_with_stdio(false);
    std::cout << fixed << setprecision(20);
  }
} iosetup;

int main() {
  int n; cin >> n;
  vector<int> c(n); REP(i, n) cin >> c[i];
  sort(ALL(c));
  ll ans = -LINF;
  {
    ll a1 = 0, b1 = 0;
    for (int i = 0; i <= n - 1 - i; ++i) {
      a1 += c[i];
      if (i < n - 1 - i) b1 += c[n - 1 - i];
    }
    ll a2 = 0, b2 = 0;
    for (int i = 0; i < n; i += 2) {
      a2 += c[i];
      if (i + 1 < n) b2 += c[i + 1];
    }
    chmax(ans, min(abs(a1) - abs(b1), abs(a2) - abs(b2)));
  }
  reverse(ALL(c));
  {
    ll a1 = 0, b1 = 0;
    for (int i = 0; i <= n - 1 - i; ++i) {
      a1 += c[i];
      if (i < n - 1 - i) b1 += c[n - 1 - i];
    }
    ll a2 = 0, b2 = 0;
    for (int i = 0; i < n; i += 2) {
      a2 += c[i];
      if (i + 1 < n) b2 += c[i + 1];
    }
    chmax(ans, min(abs(a1) - abs(b1), abs(a2) - abs(b2)));
  }
  cout << ans << '\n';
  return 0;
}