Problem A: Firebending

Firebending is the element of power. Firebenders use their energy to create bursts of fire in order to overwhelm their opponent. As a result, they want to maximize the value of each fire blast that they shoot. In order to do so, they must revisit the art of mathematics.

You will be given n integers, one per line. For each of the integers, ki, you can either keep it as ki, or change it to −ki. Find the maximum possible final sum of all the integers.

Input Format

The first line contains the integer n (1 ≤ n ≤ 100,000).
The next n lines will contain the integers ki.

Output Format

The largest possible final sum of the n integers.

```3
1
-2
3
```

```6
```

Explanation

Keep 1.
Change -2 to 2.
Keep 3.
Thus, the answer is 1 + 2 + 3 = 6.

Point Value: 3
Time Limit: 2.00s
Memory Limit: 16M
Author: thorthugnasty

Languages Allowed:
C++03, PAS, C, HASK, ASM, RUBY, PYTH2, JAVA, PHP, SCM, CAML, PERL, C#, C++11, PYTH3

• (0/0)
Why doesn't Intstream work on the judge?

• (0/0)
might be syntax error, or sadly, the wcipeg judge runs on an older version of java, thus does not support the intStream type

• (0/0)
intStream is Java 8. The judge runs Java 7.

• (0/0)
ahh rip