#include <bits/stdc++.h>
using namespace std;
const int MOD = 1000000007;
template <class T>
typename T::value_type arr_sum(const T& v, int n) {
  typename T::value_type sum = 0;
  for (int i = (0); i < (n); ++i) sum += v[i];
  return sum;
}
struct Sync_stdio {
  Sync_stdio() {
    cin.tie(NULL);
    ios_base::sync_with_stdio(false);
  }
} _sync_stdio;
int main() {
  int n;
  cin >> n;
  vector<int> a(2 * n - 1);
  for (int __i = 0; __i < (2 * n - 1); ++__i) cin >> a[__i];
  ;
  int t = 0;
  for (int i = (0); i < (2 * n - 1); ++i) {
    if (a[i] < 0) {
      ++t;
      a[i] = -a[i];
    }
  }
  sort(a.begin(), a.end());
  vector<int> d(2 * n);
  d[t] = 1;
  int flag = 1;
  while (flag) {
    flag = 0;
    for (int i = (0); i < (2 * n); ++i) {
      if (d[i] == 1) {
        continue;
      }
      for (int j = (0); j < (i + 1); ++j) {
        int x = -j + i + (n - j);
        if (!(0 <= x && x <= 2 * n)) {
          continue;
        }
        if (d[x] == 1) {
          d[i] = 1;
          flag = 1;
        }
      }
    }
  }
  int best = -1;
  for (int i = (0); i < (2 * n); ++i) {
    if (d[i] == 1) {
      best = i;
      break;
    }
  }
  int res = 0;
  for (int i = (0); i < (best); ++i) {
    res -= a[i];
  }
  for (int i = (best); i < (2 * n - 1); ++i) {
    res += a[i];
  }
  cout << res;
}
