#include <stdio.h>
#include <math.h>
#include <memory.h>

void swap(int *arrNumber, int nSrc, int nDst)
{
    int nTemp = 0;
    while(true)
    {
        if(nSrc >= nDst)
        {
            return;
        }

        nTemp = arrNumber[nSrc];
        arrNumber[nSrc] = arrNumber[nDst];
        arrNumber[nDst] = nTemp; 

        ++nSrc;
        --nDst;
    }
}

int main()
{
    int nCaseCnt = 0;
    scanf("%d", &nCaseCnt);

    for(int k=0;k<nCaseCnt;k++)
    {
        int nNumberLen = 0;
        scanf("%d", &nNumberLen);

        if(nNumberLen < 1 || nNumberLen  > 8) continue;

        int arrNumber[8];
        int arrNumber2[8];      
        for(int i=0;i<nNumberLen;i++)
        {
            scanf("%d", &arrNumber[i]);         
        }

        memcpy(arrNumber2, arrNumber, sizeof(int) * 8);

        int nSwapCount1 = 0;
        int nMinIndex = 0;
        while(nNumberLen > nMinIndex)
        {
            int nMaxValueIndex = nMinIndex;
            for(int i=nMinIndex+1;i<nNumberLen;i++)
            {
                if(arrNumber[nMaxValueIndex] > arrNumber[i])
                    nMaxValueIndex = i; 
            }

            if(nMaxValueIndex != nMinIndex)
            {
                swap(arrNumber, nMinIndex, nMaxValueIndex);
                ++nSwapCount1;
            }

            ++nMinIndex;
        }

        int nSwapCount2 = 0;
        while(nNumberLen > 0)
        {
            int nMaxValueIndex = 0;
            for(int i=1;i<nNumberLen;i++)
            {
                if(arrNumber2[nMaxValueIndex] < arrNumber2[i])
                    nMaxValueIndex = i; 
            }

            if(nMaxValueIndex < (nNumberLen - 1))
            {
                swap(arrNumber2, nMaxValueIndex, nNumberLen - 1);
                ++nSwapCount2;
            }

            --nNumberLen;
        }


        printf("%d\n", nSwapCount1 > nSwapCount2 ? nSwapCount2 : nSwapCount1);
    }

    return 0;
}