#include <bits/stdc++.h>
using namespace std;
int v[2 * 110];
int main() {
  int n, m, ans = -0x3f3f3f3f;
  cin >> n;
  m = n;
  n *= 2;
  n -= 1;
  for (int i = 0; i < n; i++) {
    cin >> v[i];
  }
  sort(v, v + n);
  if (m % 2 == 0) {
    for (int x = 0; x <= n - 1; x += 2) {
      int k = x, sum = 0;
      for (int i = 0; i < n; i++) {
        if (k) {
          sum += -1 * v[i];
          k--;
        } else {
          sum += v[i];
        }
      }
      ans = max(ans, sum);
    }
  } else {
    for (int x = 0; x <= n; x += 1) {
      int k = x, sum = 0;
      for (int i = 0; i < n; i++) {
        if (k) {
          sum += -1 * v[i];
          k--;
        } else {
          sum += v[i];
        }
      }
      ans = max(ans, sum);
    }
  }
  cout << ans << endl;
  return 0;
}
