# include <bits/stdc++.h>
# define ll long long
# define ld double
# define fi first
# define se second
# define pii pair<int, int>
# define pll pair<ll, ll>
using namespace std;

int main() {
	int cases;
	scanf("%d", &cases);
	while(cases--) {
		int N;
		scanf("%d", &N);
		map<int, int> M1, M2;
		int a1 = 0, a2 = 0;
		for(int i=0;i<N;i++) {
			int x;
			scanf("%d", &x);
			if(i%2 == 1) {
				M1[x]++;
			} else {
				M2[x]++;
			}
		}
		vector<pii> c1, c2;
		c1.clear();
		c2.clear();
		
		for(auto p : M1) c1.push_back(p);
		for(auto p : M2) c2.push_back(p);
		
		c1.push_back({-1, 0});
		c2.push_back({-2, 0});
		
		sort(c1.begin(), c1.end());
		sort(c2.begin(), c2.end());
		
		int ans;
		if(c1.back().fi == c2.back().fi) ans = N - max(c1[c1.size() - 1].se + c2[c2.size() - 2].se, c1[c1.size() - 2].se + c2[c2.size() - 1].se);
		else ans = N - c1.back().se - c2.back().se;
		
		printf("%d\n", ans);
	}
}