B'Today Alex was brought array a_1, a_2, ... , a_n of length n . He can apply as many operations as he wants (including zero operations) to change the array elements. In 1 operation Alex can choose any l and r such that 1 <= q l <= q r <= q n , and multiply all elements of the array from l to r inclusive by -1 . In other words, Alex can replace the subarray [a_l, a_{l + 1}, ... , a_r] by [-a_l, -a_{l + 1}, ... , -a_r] in 1 operation. For example, let n = 5 , the array is [1, -2, 0, 3, -1] , l = 2 and r = 4 , then after the operation the array will be [1, 2, 0, -3, -1] . Alex is late for school, so you should help him find the maximum possible sum of numbers in the array, which can be obtained by making any number of operations, as well as the minimum number of operations that must be done for this. The first line contains a single integer t ( 1 <= q t <= q 10^4 ) -- number of test cases. Then the descriptions of the test cases follow. The first line of each test case contains one integer n ( 1 <= q n <= q 2 cdot 10^5 ) -- length of the array. The second line contains n integers a_1, a_2, ... , a_n ( -10^9 <= q a_i <= q 10^9 ) -- elements of the array. It is guaranteed that the sum of n for all test cases does not exceed 2 cdot 10^5 . For each test case output two space-separated numbers: the maximum possible sum of numbers in the array and the minimum number of operations to get this sum. Pay attention that an answer may not fit in a standard integer type, so do not forget to use 64-bit integer type. Below, for each test case, only one of the possible shortest sequences of operations is provided among many. There are others that have the same length and lead to the maximum sum of elements. In the first test case, Alex can make operations: (1, 4) , (2, 2) , (6, 6) . In the second test case, to'...