#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<map>
#include<vector>
#define pr pair<int,int>
#define mkp make_pair
using namespace std;
const int N=300000;
int n,m,s,l,cnt[2][N],t,a[N],now=1;
vector<int>nxt[N];
map<pr,int>cntpr;
bool book[N];
struct qwq
{
    int val,cnt;
}p[N];
bool cmp(qwq a,qwq b)
{
    return a.cnt>b.cnt;
}
void CLEAR()
{
	for(int i=1;i<=n;i++)
	{
		cnt[0][i]=cnt[1][i]=0;
		a[i]=p[i].val=p[i].cnt=0;
		book[i]=0;
		nxt[i].clear();
	}
//	cntpr.clear();
}
int main()
{
//	freopen("qwq.in","r",stdin);
//	freopen("a.out","w",stdout);
    scanf("%d",&t);
    for(;t;t--)
    {
        scanf("%d",&n);
        cntpr.clear();
        for(int i=1;i<=n;i++)
        {
        	nxt[i].clear();
        	cnt[0][i]=cnt[1][i]=0;
		}
        for(int i=1;i<=n;i++)
        {
            scanf("%d",&a[i]);
            cnt[i&1][a[i]]++;
        }
        for(int i=1;i<=n;i++)
        {
            p[i].val=i;
            p[i].cnt=cnt[0][i];
        }
        sort(p+1,p+1+n,cmp);
        now=1;
        while(now<n)
        {
        	int val1=a[now];
        	int val2=a[now+1];
        	int id=now;
        	int siz=0;
        	for(;now<=n;now++)
        	{
        		if(a[now]==val1||a[now]==val2)
        			siz++;
        		else
        			break;
			}
			now--;
        	if(id&1)
        	{
        		nxt[val2].push_back(val1);
        		cntpr[mkp(val2,val1)]+=siz/2;
			}
        	else
        	{
        		nxt[val1].push_back(val2);
        		cntpr[mkp(val1,val2)]+=siz/2;
			}
		}
        int ans=0x3f3f3f3f;
        for(int i=1;i<=n;i++)
        {
            for(auto y:nxt[i])
            {
        	    book[y]=1;
                ans=min(ans,n-cnt[1][i]-cnt[0][y]+cntpr[mkp(i,y)]);
            }
            int now;
            for(now=1;book[p[now].val];now++);
            if(now<=n)
                ans=min(ans,n-cnt[1][i]-p[now].cnt);
            for(auto y:nxt[i])
                book[y]=0;
        }
        printf("%d\n",ans);
        for(int i=1;i<=n;i++)
            cnt[0][i]=cnt[1][i]=0;
    }
}