#include <bits/stdc++.h>

using namespace std;
vector < vector < pair <int, int> > > v(2);
vector < map <int, int> > mp(2);

int main()
{
    int n,i,t,x;
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    cin >> t;
    while(t--){
        cin >> n;
        for(i = 1; i <= n; i++){
            cin >> x;
            mp[i & 1][x]++;
        }
        for(auto x : mp[0]) v[0].push_back({x.second, x.first});
        for(auto x : mp[1]) v[1].push_back({x.second, x.first});
        sort(v[0].rbegin(), v[0].rend());
        sort(v[1].rbegin(), v[1].rend());
        if(v[0][0].second != v[1][0].second) cout << n - v[0][0].first - v[1][0].first << "\n";
        else{
            int t1 = v[1][0].first, t2 = v[0][0].first;
            if(v[0].size() > 1) t1 += v[0][1].first;
            if(v[1].size() > 1) t2 += v[1][1].first;
            cout << n - max(t1, t2) << "\n";
        }
        for(i = 0; i < 2; i++){
            v[i].clear();
            mp[i].clear();
        }
    }
    return 0;
}