# 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;
		map<pii, vector<int> > M3;
		
		int a1 = 0, a2 = 0;
		vector<int> arr(N);
		
		pii bf = {-1, -1};
		
		for(int i=0;i<N;i++) {
			scanf("%d", &arr[i]);
			if(i%2 == 1) {
				M1[arr[i]]++;
				if(i > 0) M3[{arr[i], arr[i - 1]}].push_back(i - 1);
			} else {
				M2[arr[i]]++;
				if(i > 0) M3[{arr[i - 1], arr[i]}].push_back(i - 1);
			}
		}
		
		map<pii, int> res;
		for(auto p : M3) {
			int ct = 0, cnt = 0;
			for(int k=0;k<p.se.size();k++) {
				if(cnt == 0) cnt += 2;
				else if(p.se[k] == p.se[k - 1] + 1) cnt++;
				else {
					ct += cnt / 2;
					cnt = 2;
				}
			}
			ct += cnt / 2;
			res[p.fi] = ct;
		}
		
		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 = 1e9;
		for(int i=c1.size()-1;i>=0;i--) {
			for(int k=c2.size()-1;k>=0;k--) {
				if(c1[i].fi == c2[k].fi) continue;
				
				int val = res[{c1[i].fi, c2[k].fi}];
			//	cout<<"val ; "<<c1[i].fi<<" "<<c2[k].fi<<" "<<val<<endl;
				int as = N - c1[i].se - c2[k].se + val;
				ans = min(ans, as);
				if(val == 0) break;
			}
		}
		
		printf("%d\n", ans);
	}
}