Fredo has an array A consisting of N elements. He wants to divide the array into N/2 pairs where each array element comes in exactly one pair. Say that pair i has elements Xi and Yi, he defines S as :
S=∑N/2i=1abs(Xi−Yi)
He asks you to find the minimum and maximum value of S.
Input Format:
First line consists of an integer T denoting the number of test cases.
Each test case:
First line consists of an integer N denoting the number of elements in the array.
Second line consists of N space separated integers denoting the array elements.
Output Format:
For each test case, print the minimum and maximum sum (space separated). Answer for each test case should come in a new line.
Input Constraints:
1≤T≤10
1≤N≤105
−109≤A[i]≤109
N is even
For minimum sum, we take pairs (10,20) and (−10,0).
For maximum sum, we take pairs (20,0) and (10,−10).
