#include <bits/stdc++.h>
using namespace std ;
const int N = 1e8 ;
int T ;
int n ;
int a[N] , b[N];
int main(){
	cin >> T ;
	while(T --){
		cin >> n ;
		int minn = N ;
		int maxn = -1 ;
		for(int i = 1 ; i <= n ; i ++) cin >> a[i] , b[i] = a[i];
		sort(b + 1 , b + 1 + n) ;
		for(int i = 1 ; i <= n ; i ++){
			if(a[i] != b[i]) {
				minn = min(minn , i) ;
				maxn = max(maxn , i) ;
			}
		}
		if(minn == N || maxn == -1) cout << "0\n" ;
		else cout << maxn - minn + 1 << "\n" ;
	}
}