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: """
                              pppppppppppppppppppp
                           ppppp  ppppppppppppppppppp
                        ppppppp    ppppppppppppppppppppp
                        pppppppp  pppppppppppppppppppppp
                        pppppppppppppppppppppppppppppppp
                                pppppppppppppppppppppppp
         ppppppppppppppppppppppppppppppppppppppppppppppp  pppppppppppppppppppp
        pppppppppppppppppppppppppppppppppppppppppppppppp  ppppppppppppppppppppp
       ppppppppppppppppppppppppppppppppppppppppppppppppp  pppppppppppppppppppppp
      ppppppppppppppppppppppppppppppppppppppppppppppp    pppppppppppppppppppppppp
     pppppppppppppppppppppppppppppppppppppppppppppp     pppppppppppppppppppppppppp
    ppppppppppppppppppppppppppppppppppppppppppppp      pppppppppppppppppppppppppppp
    pppppppppppppppppppppppppppppppp               pppppppppppppppppppppppppppppppp
    pppppppppppppppppppppppppppp     pppppppppppppppppppppppppppppppppppppppppppppp
    ppppppppppppppppppppppppppp    pppppppppppppppppppppppppppppppppppppppppppppppp
      pppppppppppppppppppppppp  pppppppppppppppppppppppppppppppppppppppppppppppppp
       ppppppppppppppppppppppp  ppppppppppppppppppppppppppppppppppppppppppppppppp
        pppppppppppppppppppppp  ppppppppppppppppppppppppppppppppppppppppppppppp
         ppppppppppppppppppppp  ppppppppppppppppppppppppppppppppppppppppppppp
                                pppppppppppppppppppppppp
                                pppppppppppppppppppppppppppppppp
                                pppppppppppppppppppppp  pppppppp
                                ppppppppppppppppppppp    ppppppp
                                   ppppppppppppppppppp  ppppp
                                      pppppppppppppppppppp
  """
  
  
  import sys
  from functools import lru_cache, cmp_to_key
  from heapq import merge, heapify, heappop, heappush, nsmallest
  from math import ceil, floor, gcd, fabs, factorial, fmod, sqrt, inf
  from collections import defaultdict as dd, deque, Counter as C
  from itertools import combinations as comb, permutations as perm
  from bisect import bisect_left as bl, bisect_right as br, bisect
  from time import perf_counter
  from fractions import Fraction
  from decimal import Decimal
  # sys.setrecursionlimit(pow(10, 6))
  # sys.stdin = open("consistency_chapter_2_input.txt", "r")
  # sys.stdout = open("output.txt", "w")
  
  mod = pow(10, 9) + 7
  # mod2 = 998244353
  def data(): return sys.stdin.readline().strip()
  def out(var): sys.stdout.write(str(var)+"\n")
  def outa(*var, end="\n"): sys.stdout.write(' '.join(map(str, var)) + end)
  def l(): return list(sp())
  def sl(): return list(ssp())
  def sp(): return map(int, data().split())
  def ssp(): return map(str, data().split())
  def l1d(n, val=0): return [val for i in range(n)]
  def l2d(n, m, val=0): return [l1d(n, val) for j in range(m)]
  
  
  for _ in range(int(data())):
      n = int(data())
      arr = l()
      for i in range(n):
          arr[i] &= 1
      one, zero = arr.count(1), arr.count(0)
      if abs(one - zero) >= 2:
          out(-1)
          continue
      result = inf
      prev = -1
      # Start with 0.
      ans = 0
      if n % 2 == 0 or (n % 2 == 1 and one <= zero):
          o, e = [], []
          for i in range(n):
              if i % 2 == 0 and arr[i]:
                  o.append(i)
              if i % 2 == 1 and not arr[i]:
                  e.append(i)
          while o:
              ans += abs(o.pop() - e.pop())
          result = min(ans, result)
      # Start with 1.
      ans = 0
      if n % 2 == 0 or (n % 2 == 1 and zero <= one):
          o, e = [], []
          for i in range(n):
              if i % 2 == 0 and not arr[i]:
                  o.append(i)
              if i % 2 == 1 and arr[i]:
                  e.append(i)
          while o:
              ans += abs(o.pop() - e.pop())
          result = min(ans, result)
      out(result)
  