Jax is trying to solve a problem but he has to go out to play with friends. So he ask you to solve the problem and he went to play with his friends.
You are given an array and you have to maximize the sum of the array by using below two operations each once.
1) You can choose any prefix of the array (possibly empty) and multiply with -1.
2) You can choose any suffix of the array (possibly empty) and multiply with -1.
The chosen prefix and suffix may intersect. You have to find the maximum sum of the array by performing the above operations.