#include <cassert>
#include <ranges>
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
using ll=long long;
int main(){
	cin.tie(nullptr);
	ios::sync_with_stdio(false);
	int ttt;
	cin>>ttt;
	assert(1<=ttt&&ttt<=10000);
	ll nsum=0;
	while(ttt--){
		int n;
		cin>>n;
		assert(6<=n&&n<=200000);
		assert(n%2==0);
		nsum+=n;
		vector<int> p(n);
		for(int i=0;i<n;i++)cin>>p[i];
		{
			vector<int> sp=p;
			ranges::sort(sp);
			for(int i=0;i<n;i++)assert(sp[i]==i+1);
		}
		int l=-1;
		for(int i=0;i<n;i++){
			if(p[i]==1){
				if(n%4==2)l=(i+n-n/4)%n;
				else{
					if(p[(i+1)%n]<p[(i+n-1)%n]){
						l=(i+n-n/4+1)%n;
					}else{
						l=(i+n-n/4)%n;
					}
				}
			}
		}
		int f=0;
		if(p[l]>p[(l+n/2-1)%n])f^=1;
		if(p[(l+n/2)%n]>p[(l+n-1)%n])f^=1;
		if(f)cout<<(l+n/2)%n<<endl;
		else cout<<l<<endl;
	}
	assert(nsum<=200000);
}