B"William has an array of n integers a_1, a_2, ... , a_n . In one move he can swap two neighboring items. Two items a_i and a_j are considered neighboring if the condition |i - j| = 1 is satisfied. William wants you to calculate the minimal number of swaps he would need to perform to make it so that the array does not contain two neighboring items with the same parity. Each test contains multiple test cases. The first line contains the number of test cases t ( 1 <= t <= 10^4 ). Description of the test cases follows. The first line of each test case contains an integer n (1 <= n <= 10^5) which is the total number of items in William's array. The second line contains n integers a_1, a_2, ... , a_n (1 <= a_i <= 10^9) which are William's array. It is guaranteed that the sum of n over all test cases does not exceed 10^5 . For each test case output the minimal number of operations needed or -1 if it is impossible to get the array to a state when no neighboring numbers have the same parity. In the first test case the following sequence of operations would satisfy the requirements: In the second test case the array initially does not contain two neighboring items of the same parity. In the third test case the following sequence of operations would satisfy the requirements: In the fourth test case it is impossible to satisfy the requirements. In the fifth test case the following sequence of operations would satisfy the requirements: "...