#include <bits/stdc++.h>
using namespace std;
int n, vis[300], a[300];
int solve(int neg) {
  int i, ans;
  if (vis[neg]) return 0;
  vis[neg] = 1;
  i = min(n, 2 * n - 1 - neg);
  ans = neg;
  for (i; i >= 0; i--)
    if (neg - n + 2 * i >= 0 && vis[neg - n + 2 * i] == 0)
      ans = min(ans, solve(neg - (n - i) + i));
  return ans;
}
int main(void) {
  int i, tmp, sum;
  while (scanf("%d", &n) != EOF) {
    tmp = 0;
    for (i = 0; i < 2 * n - 1; i++) {
      scanf("%d", &a[i]);
      if (a[i] < 0) {
        tmp++;
        a[i] *= -1;
      }
    }
    sort(a, a + 2 * n - 1);
    tmp = solve(tmp);
    sum = 0;
    for (i = 0; i < tmp; i++) sum += a[i] * -1;
    for (; i < 2 * n - 1; i++) sum += a[i];
    printf("%d\n", sum);
  }
  return 0;
}
