def count_inversions(a):
    inv = 0
    n = len(a)
    for i in range(n):
        for j in range(i + 1, n):
            if a[i] > a[j]:
                inv += 1
    return inv
 
def solve():
    n = int(input())
    p = list(map(int, input().split()))
 
    min_inv = float('inf')
 
    for mask in range(1 << n):
        a = [0] * n
        for i in range(n):
            if (mask >> i) & 1:
                a[i] = 2 * n - p[i]
            else:
                a[i] = p[i]
        inv = count_inversions(a)
        min_inv = min(min_inv, inv)
 
    print(min_inv)
 
t = int(input())
for _ in range(t):
    solve()
 

ZGVmIGNvdW50X2ludmVyc2lvbnMoYSk6CiAgICBpbnYgPSAwCiAgICBuID0gbGVuKGEpCiAgICBmb3IgaSBpbiByYW5nZShuKToKICAgICAgICBmb3IgaiBpbiByYW5nZShpICsgMSwgbik6CiAgICAgICAgICAgIGlmIGFbaV0gPiBhW2pdOgogICAgICAgICAgICAgICAgaW52ICs9IDEKICAgIHJldHVybiBpbnYKCmRlZiBzb2x2ZSgpOgogICAgbiA9IGludChpbnB1dCgpKQogICAgcCA9IGxpc3QobWFwKGludCwgaW5wdXQoKS5zcGxpdCgpKSkKCiAgICBtaW5faW52ID0gZmxvYXQoJ2luZicpCgogICAgZm9yIG1hc2sgaW4gcmFuZ2UoMSA8PCBuKToKICAgICAgICBhID0gWzBdICogbgogICAgICAgIGZvciBpIGluIHJhbmdlKG4pOgogICAgICAgICAgICBpZiAobWFzayA+PiBpKSAmIDE6CiAgICAgICAgICAgICAgICBhW2ldID0gMiAqIG4gLSBwW2ldCiAgICAgICAgICAgIGVsc2U6CiAgICAgICAgICAgICAgICBhW2ldID0gcFtpXQogICAgICAgIGludiA9IGNvdW50X2ludmVyc2lvbnMoYSkKICAgICAgICBtaW5faW52ID0gbWluKG1pbl9pbnYsIGludikKCiAgICBwcmludChtaW5faW52KQoKdCA9IGludChpbnB1dCgpKQpmb3IgXyBpbiByYW5nZSh0KToKICAgIHNvbHZlKCkK

NQoyCjIgMQozCjIgMSAzCjQKNCAzIDIgMQo1CjIgMyAxIDUgNAo2CjIgMyA0IDEgNSA2Cg==

5
2
2 1
3
2 1 3
4
4 3 2 1
5
2 3 1 5 4
6
2 3 4 1 5 6