Problem:
Score : 400 points

Problem Statement

There are N integers, A_1, A_2, ..., A_N, arranged in a row in this order.

You can perform the following operation on this integer sequence any number of times:

Operation: Choose an integer i satisfying 1 \leq i \leq N-1. Multiply both A_i and A_{i+1} by -1.

Let B_1, B_2, ..., B_N be the integer sequence after your operations.

Find the maximum possible value of B_1 + B_2 + ... + B_N.

Constraints

All values in input are integers.

2 \leq N \leq 10^5

-10^9 \leq A_i \leq 10^9

Input

Input is given from Standard Input in the following format:

N
A_1 A_2 ... A_N

Output

Print the maximum possible value of B_1 + B_2 + ... + B_N.

Sample Input 1

3
-10 5 -4

Sample Output 1

19

If we perform the operation as follows:

Choose 1 as i, which changes the sequence to 10, -5, -4.

Choose 2 as i, which changes the sequence to 10, 5, 4.

we have B_1 = 10, B_2 = 5, B_3 = 4. The sum here, B_1 + B_2 + B_3 = 10 + 5 + 4 = 19, is the maximum possible result.

Sample Input 2

5
10 -4 -8 -11 3

Sample Output 2

30

Sample Input 3

11
-1000000000 1000000000 -1000000000 1000000000 -1000000000 0 1000000000 -1000000000 1000000000 -1000000000 1000000000

Sample Output 3

10000000000

The output may not fit into a 32-bit integer type.

Solution in C# (Mono 4.6.2.0) (judge verdict: Runtime Error)

using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using System.Threading.Tasks;

class Program {
    static void Main(string[] args) {
        //入力
        int N = int.Parse(Console.ReadLine());
        string s = Console.ReadLine();
        //int[] A = new int[N];
        List<int> A = new List<int>();
        //変数の割り当て
        for (int i = 0; i < N; i++) {
            A.Add(int.Parse(s.Split(' ')[i]));
        }

        //全体の中で負の数が正の個数の時
        int cnt = 0;
        int zeroCnt = 0;  //ゼロの個数
        cnt = A.Count(value => value < 0);

        //Console.WriteLine(cnt);

        //配列Aの絶対値を取った数列
        //int[] B = new int[N];
        List<int> B = new List<int>();
        for (int i = 0; i < N; i++) {
            if (A[i] != 0) {
                B.Add(Math.Abs(A[i]));
            } else {
                zeroCnt++;
            }
        }
        //配列Bをソート
        B.Sort();

        //回答となる数値
        int ans = B.Sum();

        //奇数の時
        if (cnt % 2 != 0 && zeroCnt == 0) {
            ans -= 2 * B[0];
        }

        //出力
        Console.WriteLine(ans);
    }
}