#include<iostream>
#include<cstdio>
#include<map>
#include<algorithm> 
#define mk make_pair
using namespace std;
const int N=3*1e5;
int t,n;
int a[N];
map<pair<int,int> , int > m;
struct aa{
	int cnt,id;
}odd[N];
aa even[N];
bool cmp(aa a,aa b){
	return a.cnt>b.cnt;
}

int main(){
	cin>>t;
	while(t--){
		int ans=99999999;
		m.clear();
		scanf("%d",&n);
		for(int i=1;i<=n;i++){
			scanf("%d",&a[i]);
		}
		int len=2;
		pair<int,int> d=mk(a[1],a[2]),e=mk(0,0);
		odd[a[1]].id=a[1];
		odd[a[1]].cnt=1;
		for(int i=3;i<=n;i+=2){
			odd[a[i]].cnt++;
			odd[a[i]].id=a[i];
			e=mk(a[i],a[i+1]);
			if(e!=d){
				m[d]+=len;
				len=2;
				d=e;
			}else
				len+=2;
		}
		m[e]+=len;
		len=2;
		d=mk(a[2],a[3]);
		e=mk(0,0);
		even[a[2]].cnt=1;
		even[a[2]].id=a[2];
		for(int i=4;i<=n;i+=2){
			even[a[i]].cnt++;
			even[a[i]].id=a[i];
			e=mk(a[i],a[i+1]);
			if(e!=d){
				m[d]+=len;
				len=2;
				d=e;
			}else len+=2;
		}
		sort(odd+1,odd+1+n,cmp);
		sort(even+1,even+1+n,cmp);
		for(int i=1;i<=n;i++){
			int c=odd[i].id;
			for(int j=1;j<=n;j++){
				int d=even[j].id;
				if(d==c)continue;
				ans=min(ans,n+m[mk(d,c)]/2-odd[i].cnt-even[j].cnt);
				if(m[mk(d,c)]==0)
				break;	
			}
		}
		cout<<ans<<endl;
	}
}