import java.util.Collections;
import java.util.HashMap;
import java.util.LinkedList;
import java.util.Queue;
import java.util.Scanner;
import java.util.Vector;

public class Main {

    static HashMap <Vector<Integer>, Integer> toSort = new HashMap<>();

    public static void main(String[] args) {
        // TODO Auto-generated method stub
        Scanner sc = new Scanner(System.in);
        int T = sc.nextInt();
        sc.nextLine();
        int test_case;
        for(int i = 1; i <= 8; i++)
            precalc(i);
        for(test_case = 0; test_case < T; test_case++){
            int size = sc.nextInt();
            sc.nextLine();
            Vector<Integer> perm = new Vector<Integer>();
            for(int i = 0; i < size; i++)
                perm.addElement(sc.nextInt());
            sc.nextLine();
            int result = solve(perm);
            System.out.println(result);
        }       

    }

    public static void precalc(int n){
        Vector<Integer> perm = new Vector<Integer>();
        for(int i = 0; i < n; i++)
            perm.add(i);
        Queue<Vector<Integer>> q = new LinkedList<Vector<Integer>>();
        q.offer(perm);
        toSort.put(perm, 0);
        while(!q.isEmpty()){
            Vector <Integer> here = q.peek();
            q.poll();
            int cost = toSort.get(here);
            for(int i = 0; i < n; i++)
                for(int j = 2; j <= n; j++){
                    reverse(here,i,j);
                    Vector<Integer> there =  new Vector<Integer>();
                    there.addAll(here);
                    if(!toSort.containsKey(there)){
                        toSort.put(there, cost + 1);
                        q.offer(there);
                    }
                    reverse(here,i,j);
                }
        }
    }

    public static int solve (Vector<Integer> perm){
        int  n = perm.size();
        Vector<Integer> fixed = new Vector<Integer>();
        fixed.setSize(n);
        for(int i = 0; i < n; i++){
            int smaller = 0;
            for(int j = 0; j < n; j++)
                if(perm.get(j) < perm.get(i))
                    smaller++;
            fixed.set(i, smaller);
        }
        return toSort.get(fixed);
    }

    public static void reverse(Vector<Integer> here, int start, int end){
        Vector<Integer> temp = new Vector<Integer>();
        for(int i = end - 1; i >= start; i-- ){
            temp.addElement(here.get(i));
        }
        for(int i = 0; i < end - start; i++)
            here.set(i+start, temp.get(i));     
    }

}