#include <iostream>
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define ii pair<int,int>
const int mod = 1e9 + 7;
const int inf = 2e9 + 9;
const int N = 2e5 + 9;
void sol() {
	int n; cin >> n;
	int A[n];
	map<int,int> M1, M2;
	for(int i = 0 ; i < n ; i ++) {
		cin >> A[i];
		if(i % 2 == 0) M1[A[i]] ++;
		else           M2[A[i]] ++;
	}
	int x1 = -1;
	int max1 = 0;
	
	for(int i = 0 ; i < n ; i += 2)
		if(M1[A[i]] > max1) x1 = A[i], max1 = M1[A[i]];
	
	int max2 = 0;
	for(int i = 1 ; i < n ; i += 2)
		if(M2[A[i]] > max2 && A[i] != x1) max2 = M2[A[i]];
	
	int a = (n / 2), b = n - a;
	cout << (a - max1) + (b - max2) << endl;
}
int main() {
	int t; cin >> t;
	while(t --) sol();
	return 0;
}