#include <bits/stdc++.h>
using namespace std;
const int maxn = 100 + 5;
int num[maxn * 2];
int abs(int x) { return x < 0 ? -x : x; }
int main() {
  int n;
  while (cin >> n) {
    int sum = 0, ans;
    for (int i = 0; i < 2 * n - 1; i++) {
      cin >> num[i];
      sum += num[i];
    }
    sort(num, num + 2 * n - 1);
    if (n % 2) {
      ans = 0;
      for (int i = 0; i < 2 * n - 1; i++) ans += abs(num[i]);
    } else {
      ans = sum;
      for (int i = 0; i < 2 * n - 2; i += 2) {
        ans = max(ans, sum += -2 * num[i] - 2 * num[i + 1]);
      }
    }
    cout << ans << endl;
  }
  return 0;
}
