#include <bits/stdc++.h>
using namespace std;
const long long INF = 1000000000000000;
int main(){
  int N;
  cin >> N;
  vector<int> c(N);
  for (int i = 0; i < N; i++){
    cin >> c[i];
  }
  sort(c.begin(), c.end());
  vector<long long> ans(4);
  for (int i = 0; i < (1 << 2); i++){
    deque<int> dq;
    for (int i = 0; i < N; i++){
      dq.push_back(c[i]);
    }
    long long a = 0, b = 0;
    for (int j = 0; j < N; j++){
      if (j % 2 == 0){
        if (i % 2 == 0){
          a += dq.front();
          dq.pop_front();
        } else {
          a += dq.back();
          dq.pop_back();;
        }
      } else {
        if (i / 2 % 2 == 0){
          b += dq.front();
          dq.pop_front();
        } else {
          b += dq.back();
          dq.pop_back();
        }
      }
    }
    ans[i] = abs(a) - abs(b);
  }
  cout << max(min(ans[0], ans[2]), min(ans[1], ans[3])) << endl;
}