#include <bits/stdc++.h>
using namespace std;
int n, n1, a[220];
int col[220], can;
void dfs(int s);
int mini(int a, int b) {
  if (a < b) return a;
  return b;
}
int main() {
  int i, j, k, l, test, t = 1;
  scanf("%d", &n);
  n1 = (2 * n) - 1;
  int sum = 0, neg = 0, min1;
  for (i = 1; i <= n1; i++) {
    scanf("%d", &a[i]);
    if (a[i] < 0) {
      neg++;
      a[i] *= -1;
    }
    sum += a[i];
    if (i == 1) min1 = a[i];
    if (a[i] < min1) min1 = a[i];
  }
  can = neg;
  dfs(neg);
  sort(a + 1, a + n1 + 1);
  for (i = 1; i <= can; i++) {
    sum -= (a[i] * 2);
  }
  printf("%d\n", sum);
  return 0;
}
void dfs(int s) {
  if (s < can) can = s;
  if (col[s]) return;
  col[s] = 1;
  int rem = n1 - s;
  rem = mini(n, rem);
  for (int i = 0; i <= rem; i++) {
    int rem1 = n - i;
    if (rem1 > s) continue;
    dfs(s - rem1 + i);
  }
}
