#include <iostream>
#include <cstdio>
#include <cstring>
#include <stack>
#include <queue>
#include <map>
#include <algorithm>
using namespace std;
const int N = 110;
int a[N];
int b[N];
bool cmp(int x,int y)
{
    return x<y;
}
int main()
{
    int n;
    int t;
    scanf("%d",&t);
    while(t--)
    {
        scanf("%d",&n);
        int tt;
        for(int i=1;i<=n;i++)
        {
            scanf("%d",&a[i]);
            if (a[i] == n) tt = i;
        }
        int ans = n-1;
        memset(b,0,sizeof(b));
        bool flag = 0;
        for(int i=n-1;i;i--)
        {
            flag = 1;
            for(int j=1;j<=n;j++)
            {
                if(a[j] == i && j<tt)
                {
                    ans--;
                    tt = j;
                    //cout<<j<<endl;
                    //cout<<ans<<endl;
                    flag = 0;
                    break;
                }
            }
            if(flag) break;
        }
        printf("%d\n",ans);
    }
    return 0;
}