#include <bits/stdc++.h>
using namespace std;
const double PI = 2.0 * acos(0.0);
const double EPS = 1e-6;
bool dp[205];
int n;
void DFS(int vtx) {
  dp[vtx] = true;
  int neg = 2 * n - 1 - vtx;
  for (int b = 0; b <= n && b <= neg; b++) {
    int a = n - b;
    int transfer = b - a;
    if (vtx + transfer >= 0 && vtx + transfer <= 2 * n - 1 &&
        !dp[vtx + transfer])
      DFS(vtx + transfer);
  }
}
int main() {
  scanf("%d", &n);
  int arr[205];
  int sum = 0;
  int positive = 0;
  int minn = (1 << 29);
  bool zero = false;
  for (int i = 0; i < 2 * n - 1; i++) {
    scanf("%d", &arr[i]);
    sum += abs(arr[i]);
    minn = min(minn, abs(arr[i]));
    if (arr[i] >= 0) positive++;
    if (arr[i] == 0) zero = true;
  }
  if (zero) return printf("%d\n", sum), 0;
  DFS(positive);
  if (dp[2 * n - 1])
    printf("%d\n", sum);
  else
    printf("%d\n", sum - 2 * minn);
  return 0;
}
