1038_D. Slime
There are n slimes in a row. Each slime has an integer value (possibly negative or zero) associated with it.

Any slime can eat its adjacent slime (the closest slime to its left or to its right, assuming that this slime exists). 

When a slime with a value x eats a slime with a value y, the eaten slime disappears, and the value of the remaining slime changes to x - y.

The slimes will eat each other until there is only one slime left. 

Find the maximum possible value of the last slime.

Input

The first line of the input contains an integer n (1 ≤ n ≤ 500 000) denoting the number of slimes.

The next line contains n integers a_i (-10^9 ≤ a_i ≤ 10^9), where a_i is the value of i-th slime.

Output

Print an only integer — the maximum possible value of the last slime.

Examples

Input

4
2 1 2 1


Output

4

Input

5
0 -1 -1 -1 -1


Output

4

Note

In the first example, a possible way of getting the last slime with value 4 is:

  * Second slime eats the third slime, the row now contains slimes 2, -1, 1
  * Second slime eats the third slime, the row now contains slimes 2, -2
  * First slime eats the second slime, the row now contains 4 



In the second example, the first slime can keep eating slimes to its right to end up with a value of 4.
```python
import sys
import os

def solve(slimes):
    if len(slimes) == 1:
        return slimes[0]

    havePos = False
    haveNeg = False

    for s in slimes:
        if s > 0:
            havePos = True
        elif s < 0:
            haveNeg = True

    if havePos and haveNeg:
        return sum(map(abs, slimes))
    elif not havePos:
        m = max(slimes)
        return sum(list(map(abs, slimes))) + 2 * m
    elif not haveNeg:
        m = min(slimes)
        return sum(list(map(abs, slimes))) - 2 * m
    else:
        return 0

def main():
    n = int(input())
    slimes = list(map(int, input().split()))
    print(solve(slimes))


if __name__ == '__main__':
    main()
```