#include <bits/stdc++.h>
using namespace std;
int n;
int a, b;
int v[100010];
queue<pair<int, int> > Q;
map<pair<int, int>, int> M;
int main() {
  cin >> n;
  for (int i = 1; i < 2 * n; i++) {
    cin >> v[i];
    if (v[i] < 0)
      a++, v[i] = -v[i];
    else
      b++;
  }
  int mx = 0;
  Q.push({a, b});
  while (!Q.empty()) {
    int a = Q.front().first;
    int b = Q.front().second;
    Q.pop();
    if (M[{a, b}] == 1) continue;
    M[{a, b}] = 1;
    mx = max(mx, b);
    for (int i = 0, h = n; i <= n; i++, h--) {
      if (a < i || b < h) continue;
      int x = a - i + h;
      int y = b - h + i;
      if (x < 0 || x > 2 * n - 1 || y < 0 || y > 2 * n - 1) continue;
      Q.push({x, y});
    }
  }
  sort(v + 1, v + 2 * n);
  int sum = 0;
  for (int i = 1; i < 2 * n; i++) {
    if (i <= 2 * n - 1 - mx)
      sum -= v[i];
    else
      sum += v[i];
  }
  cout << sum;
}
