#include<iostream>
#include<cstring>
#include<queue>
#include<cstdio>
#include<cmath>
#include<algorithm>
using namespace std;
#define N 200005
int main()
{
int n,m;
int i,j,k;
while(cin>>n)
{
int sum=0;
int min=2100000000;
int mid=2100000000;
int count=0;
for(i=0;i<2*n-1;i++)
{
cin>>k;
sum+=abs(k);
if(abs(k)<min) min=abs(k);
if(k<0) count++;
}
if(count%2==1&&n%2==0) sum-=(2*min);
cout<<sum<<endl;
}
return 0;
}