#include <bits/stdc++.h>
using namespace std;
const int c=200005;
int n, t[c], l[c], ans, ps[c], pn[c];
map<pair<int, int>, int> f;
vector<pair<int, int> > x, y;
void solve() {
    cin >> n;
    for (int i=1; i<=n; i++) {
        cin >> t[i];
        if (i>1) {
            if (!l[i-1] || t[i]!=t[i-2]) {
                l[i]=1;
                int a=t[i-1], b=t[i];
                if (i%2) {
                    swap(a, b);
                }
                f[{a, b}]++;
            }
        }
        if (i%2) {
            pn[t[i]]++;
        } else {
            ps[t[i]]++;
        }
    }
    for (int i=1; i<=n; i++) {
        x.push_back({ps[i], i});
        y.push_back({pn[i], i});
    }
    sort(x.rbegin(), x.rend()), sort(y.rbegin(), y.rend());
    for (auto p:x) {
        int a=p.second;
        for (auto q:y) {
            int b=q.second;
            if (a==b) continue;
            int s=f[{a, b}];
            ans=max(ans, ps[a]+pn[b]-s);
            if (!s) {
                f.erase({a, b});
                break;
            }
        }
    }
    cout << n-ans << "\n";

    for (int i=0; i<=n; i++) {
        ps[i]=0, pn[i]=0;
        l[i]=0, t[i]=0;
    }
    ans=0;
    f.clear(), x.clear(), y.clear();

}
int main() {
	ios_base::sync_with_stdio(false);
    int w;
    cin >> w;
    while (w--) {
        solve();
    }
}