#include <bits/stdc++.h>
using namespace std;
const int MAXN=3e5+10;
int T,a[MAXN],jq[MAXN],o[MAXN],cntj[MAXN],cnto[MAXN],n;
map<int,int>mp[MAXN];
bool cmp1(int x,int y){
	return cntj[x]>cntj[y];
}
bool cmp2(int x,int y){
	return cnto[x]>cnto[y];
}
int main(){
	cin>>T;
	while(T--){

		cin>>n;
		for(int i=1;i<=n+1;i++)jq[i]=o[i]=i,mp[i].clear(),cntj[i]=cnto[i]=0;
		
		for(int i=1;i<=n;i++){
			cin>>a[i];
			if(i&1)cntj[a[i]]++;
			else cnto[a[i]]++;
		}
		sort(jq+1,jq+1+n,cmp1);
		sort(o+1,o+1+n,cmp2);
		for(int i=1;i<=n;i++){
			if(i&1)mp[a[i]][a[i+1]]++;
			else mp[a[i+1]][a[i]]++;
			if(a[i]==a[i+2])++i;
		}
		int ans=INT_MAX;
		for(int i=1;i<=n;i++){
			for(int j=1;j<=n;j++){
				if(o[i]==jq[j])continue;
				ans=min(ans,n-cnto[o[i]]-cntj[jq[j]]+mp[jq[j]][o[i]]);
				if(mp[jq[j]][o[i]]==0)break;
			}
		}
		cout<<(ans-1)<<endl;
	}
	
	return 0;
}