#include <bits/stdc++.h>
using namespace std;
template<typename T>void read(T &x)
{
    T f=1;x=0;char s=getchar();
    while(s<'0'||s>'9'){if(s=='-')f=-1;s=getchar();}
    while(s>='0'&&s<='9') {x=x*10+s-'0';s=getchar();}
    x*=f;
}
map<int,int>M[200005];
int P[200005],arr[200005],C1[200005],C2[200005];
bool cmp(int a,int b){return C2[a]>C2[b];}
int main() {
    int T,n;read(T);
    while(T--)
    {
        read(n);
        for(int i=1;i<=n;i++) C1[i]=C2[i]=0;
        for(int i=1,x;i<=n;i++)
        {
            M[i].clear();
            read(arr[i]); P[i]=i;
            if(i&1) C1[arr[i]]++;
            else C2[arr[i]]++;
        }
        sort(P+1,P+1+n,cmp);
        for(int i=1;i<=n;i++)
        {
            if(i&1) M[arr[i+1]][arr[i]]++;
            else M[arr[i]][arr[i+1]]++;
          	if(arr[i]==arr[i+2]) i++;
        }
        int Ans=0;
        for(int i=1;i<=n;i++)
        {
            for(auto j:M[i]) Ans=max(Ans,C1[i]+C2[j.first]-j.second);
            for(int j=1;j<=n;j++)
            {
                if(!M[i].count(P[j])&&i!=P[j]) {Ans=max(Ans,C1[i]+C2[P[j]]);break;}
            }
        }
        printf("%d\n",n-Ans);
    }
    return 0;
}