#include <bits/stdc++.h>
using namespace std;
int dump_char;
int main() {
  int n, x, i;
  vector<int> pos, neg;
  scanf("%d", &n);
  for (i = 0; i < 2 * n - 1; i++) {
    scanf("%d", &x);
    if (x < 0) {
      neg.push_back(x * (-1));
    } else {
      pos.push_back(x);
    }
  }
  sort(neg.begin(), neg.end());
  sort(pos.begin(), pos.end());
  while (neg.size() >= n) {
    for (i = 0; i < n; i++) {
      pos.push_back(neg[neg.size() - 1]);
      neg.pop_back();
    }
  }
  sort(pos.begin(), pos.end());
  if (n % 2 == 0 && neg.size() % 2) {
    x = min(neg[0], pos[0]);
  } else {
    x = 0;
  }
  x = x * (-2);
  for (i = 0; i < pos.size(); i++) x += pos[i];
  for (i = 0; i < neg.size(); i++) x += neg[i];
  printf("%d\n", x);
  return 0;
}
