Given an array A of length N, you need to create a new array B by removing exactly 2N/3 elements from A without changing the order.
The score is defined as:
Score = (The sum of the elements in the first half of B) - (The sum of the elements in the second half of B)
Your task is to find the maximum possible score.
Note:
It is guaranteed that N is divisible by 3.
Any element from A can be removed such that the score is maximized.
Input Format:
The first line contains an integer N, denoting the number of elements in A.
Each of the N subsequent lines contains an integer describing A[i].
Constraints:
1 <= N <= 10^5
1 <= A[i] <= 10^9
Sample Test Cases:
Case 1:

Input 
3
1
2
3

Output 
1

Upcoming infosys interview Slots are available