description: <image>
  
  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.
  
  Input
  
  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.
  
  Output
  
  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.
  
  Example
  
  Input
  
  
  5
  3
  6 6 1
  1
  9
  6
  1 1 1 2 2 2
  2
  8 6
  6
  6 2 3 4 5 1
  
  
  Output
  
  
  1
  0
  3
  -1
  2
  
  Note
  
  In the first test case the following sequence of operations would satisfy the requirements: 
  
    1. swap(2, 3). Array after performing the operation: [6, 1, 6] 
  
  
  
  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: 
  
    1. swap(3, 4). Array after performing the operation: [1, 1, 2, 1, 2, 2] 
    2. swap(2, 3). Array after performing the operation: [1, 2, 1, 1, 2, 2] 
    3. swap(4, 5). Array after performing the operation: [1, 2, 1, 2, 1, 2] 
  
  
  
  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: 
  
    1. swap(2, 3). Array after performing the operation: [6, 3, 2, 4, 5, 1] 
    2. swap(4, 5). Array after performing the operation: [6, 3, 2, 5, 4, 1] 
solution: //package DeltixAug21;
  
  import java.util.*;
  import java.lang.*;
  import java.io.*;
  
  // Created by @thesupremeone on 29/08/21
  public class B {
      int n;
      int[] arr;
      TreeSet<Integer> odds, evens;
      void refill(){
          odds.clear();
          evens.clear();
          for (int i = 0; i < n; i++) {
              if(arr[i]%2==0)
                  evens.add(i);
              else
                  odds.add(i);
          }
      }
      int swaps(int pairity){
          int swaps = 0;
          for (int i = 0; i < n; i++) {
              TreeSet<Integer> set = i%2==pairity ? evens : odds;
              TreeSet<Integer> antiSet = i%2==pairity ? odds : evens;
              Integer d = set.pollFirst();
              if(d==null){
                  swaps = Integer.MAX_VALUE;
                  break;
              }
              int diff = Math.abs(d-i);
              if(diff!=0){
                  swaps+=diff;
                  antiSet.pollFirst();
                  antiSet.add(d);
              }
          }
          return swaps;
      }
      void solve() throws IOException {
          int ts = getInt();
          for (int t = 1; t <= ts; t++){
              n = getInt();
              odds = new TreeSet<>();
              evens = new TreeSet<>();
              arr = new int[n];
              for (int i = 0; i < n; i++) {
                  arr[i] = getInt();
              }
              refill();
              int difference = Math.abs(odds.size()-evens.size());
              if((n%2==0 && difference!=0) || (n%2==1 && difference!=1)){
                  println(-1);
                  continue;
              }
              int swaps1 = swaps(0);
              refill();
              int swaps2 = swaps(1);
              println(Math.min(swaps1, swaps2));
          }
      }
  
      public static void main(String[] args) throws Exception {
          if (isOnlineJudge()) {
              in = new BufferedReader(new InputStreamReader(System.in));
              out = new BufferedWriter(new OutputStreamWriter(System.out));
              new B().solve();
              out.flush();
          } else {
              localJudge = new Thread();
              in = new BufferedReader(new FileReader("input.txt"));
              out = new BufferedWriter(new FileWriter("output.txt"));
              localJudge.start();
              new B().solve();
              out.flush();
              localJudge.suspend();
          }
      }
      static boolean isOnlineJudge(){
          try {
              return System.getProperty("ONLINE_JUDGE")!=null
                      || System.getProperty("LOCAL")==null;
          }catch (Exception e){
              return true;
          }
      }
      // Fast Input & Output
      static Thread localJudge = null;
      static BufferedReader in;
      static StringTokenizer st;
      static BufferedWriter out;
      static String getLine() throws IOException{
          return in.readLine();
      }
      static String getToken() throws IOException{
          if(st==null || !st.hasMoreTokens())
              st = new StringTokenizer(getLine());
          return st.nextToken();
      }
      static int getInt() throws IOException {
          return Integer.parseInt(getToken());
      }
      static long getLong() throws IOException {
          return Long.parseLong(getToken());
      }
      static void print(Object s) throws IOException{
          out.write(String.valueOf(s));
      }
      static void println(Object s) throws IOException{
          out.write(String.valueOf(s));
          out.newLine();
      }
  }