//https://algospot.com/judge/problem/read/SORTGAME
#include <iostream>
using namespace std;

int C;
int N;
int data[8 + 1];
int sortData[8 + 1];
void Reverse(int nums[], int first, int end)
{
    int temp = 0;
    int end_index = end;
    int half = (first + end) / 2;
    for (int i = first; i <= half; i++)
    {
        temp = nums[i];
        nums[i] = nums[end_index];
        nums[end_index] = temp;
        end_index--;
    }
}
void q_sort(int nums[], int left, int right)
{
    int pivot, l_hold, r_hold;
    l_hold = left;
    r_hold = right;
    pivot = nums[left];
    if (left == right)
    {
        return;
    }
    while (left < right)
    {
        while ( (pivot <= nums[right]) && (left < right))
        {
            right--;
        }
        if (left != right)
        {
            nums[left] = nums[right];
            left++;
        }
        while ((pivot >= nums[left]) && (left < right))
        {
            left++;
        }
        if (left != right)
        {
            nums[right] = nums[left];
            right--;
        }
    }
    nums[left] = pivot;
    pivot = left;
    left = l_hold;
    right = r_hold;
    if (left < pivot)
    {
        q_sort(nums, left, pivot - 1);
    }
    if (right > pivot)
    {
        q_sort(nums, pivot + 1, right);
    }
}
void QuickSort(int nums[], int size)
{
    q_sort(nums, 0, size-1);
}

int main()
{
    int noSortStartIndex = -1;
    int noSortEndIndex = -1;
    int min = 999999;
    int minIndex = 0;
    bool isSame = false;
    int count = 0;
    cin >> C;
    while (C--)
    {
        for (int i = 0; i < 8; i++)
        {
            data[i] = 0;
            sortData[i] = 0;
        }
        cin >> N;
        for (int i = 0; i < N; i++)
        {
            cin >> data[i];
            sortData[i] = data[i];
        }
        QuickSort(sortData, N);

        while (!isSame)
        {
            for (int i = 0; i < N; i++)
            {
                if (data[i] != sortData[i])
                {
                    break;
                }
                if (i == N - 1)
                {
                    isSame = true;
                }

            }
            if (isSame)
                break;

            for (int i = 0; i < N; i++)
            {
                if (data[i] != sortData[i])
                {
                    if (noSortStartIndex == -1)
                    {
                        noSortStartIndex = i;
                    }
                    else
                    {
                        noSortEndIndex = i;
                    }
                }
            }

            for (int i = noSortStartIndex; i <= noSortEndIndex; i++)
            {
                if (min > data[i])
                {
                    min = data[i];
                    minIndex = i;
                }
            }
            Reverse(data, noSortStartIndex, minIndex);          
            count++;
            noSortStartIndex = -1;
            noSortEndIndex = -1;
            min = 999999;
            minIndex = 0;
        } // end of while(!isSame)

        cout << count << endl;
        count = 0;
        isSame = false;
    }
    return 0;
}