#include <bits/stdc++.h>
using namespace std;
const int INF = 1000000;
bool vis[210][210];
int res;
void dfs(int neg, int pos, int m, int* a) {
  if (vis[neg][pos]) return;
  vis[neg][pos] = true;
  for (int i = 0, _n = neg + 1; i < _n; i++) {
    int j = m - i;
    if (j < 0 || j > pos) continue;
    dfs(neg - i + j, pos - j + i, m, a);
  }
  int sum = 0;
  sum = accumulate(a, a + 2 * m - 1, 0);
  for (int i = 0, _n = neg; i < _n; i++) {
    sum -= (2 * a[i]);
  }
  res = max(res, sum);
}
void main2() {
  memset(vis, false, sizeof(vis));
  int n, m;
  n = ({
    int t;
    scanf("%d", &t);
    t;
  });
  m = n;
  n = 2 * n - 1;
  int a[n];
  int neg = 0;
  for (int i = 0, _n = n; i < _n; i++) {
    a[i] = ({
      int t;
      scanf("%d", &t);
      t;
    });
    neg += a[i] > 0 ? 0 : 1;
    a[i] = abs(a[i]);
  }
  sort(a, a + n);
  res = -INF;
  dfs(neg, n - neg, m, a);
  printf("%d\n", res);
}
int main() {
  ios_base::sync_with_stdio(false);
  main2();
}
