#include <bits/stdc++.h>
using namespace std;

template <class A, class B> bool cmin(A& a, B b) { return a > b && (a = b, true); }
template <class A, class B> bool cmax(A& a, B b) { return a < b && (a = b, true); }

signed main() {
  cin.tie(nullptr)->sync_with_stdio(false);

  long N;
  cin >> N;
  vector<long> A(N);
  for (long i = 0; i < N; i++) cin >> A.at(i);

  auto f1 = [&]() {
    sort(A.begin(), A.end());
    long x = 0, y = 0;
    for (long i = 0; i < N; i++) {
      if (i % 2) y += A.at(i);
      else x += A.at(i);
    }
    return abs(x) - abs(y);
  };

  auto f2 = [&]() {
    sort(A.begin(), A.end());
    long acc = accumulate(A.begin(), A.end(), 0L);
    long x = accumulate(A.begin(), A.begin() + (N + 1) / 2, 0L);
    long y = acc - x;
    return abs(x) - abs(y);
  };

  auto f3 = [&]() {
    sort(A.rbegin(), A.rend());
    long x = 0, y = 0;
    for (long i = 0; i < N; i++) {
      if (i % 2) y += A.at(i);
      else x += A.at(i);
    }
    return abs(x) - abs(y);
  };

  auto f4 = [&]() {
    sort(A.rbegin(), A.rend());
    long acc = accumulate(A.begin(), A.end(), 0L);
    long x = accumulate(A.begin(), A.begin() + (N + 1) / 2, 0L);
    long y = acc - x;
    return abs(x) - abs(y);
  };

  long a = f1();
  long b = f2();
  long c = f3();
  long d = f4();

  if (min(a, b) > min(c, d)) cout << min(a, b) << '\n';
  else cout << min(c, d) << '\n';
}