#include using namespace std; #define FOR(i,a,b) for(int i=(a);i<(b);i++) #define REP(i,n) FOR(i,0,n) #define ALL(v) (v).begin(),(v).end() template inline bool chmax(A &a, B b) { if (a inline bool chmin(A &a, B b) { if (a>b) { a=b; return 1; } return 0; } typedef unsigned long long ull; typedef long long ll; typedef pair pii; typedef pair pll; typedef pair P; const ll INF = 1ll<<29; const ll MOD = 1000000007; const double EPS = 1e-10; int N; int a[100]; int main() { int T; cin >> T; while (T--) { scanf("%d", &N); REP(i, N) scanf("%d", a + i); map m; REP(i, N) m[a[i]]++; priority_queue pq; for (map::iterator it = m.begin(); it != m.end(); ++it) pq.push(it->second); int ans = 0; while (pq.size() >= 3) { int cnt[3]; REP(i, 3) { cnt[i] = pq.top(); pq.pop(); } ans += cnt[2]; REP(i, 3) cnt[i] -= cnt[2]; REP(i, 3) if (cnt[i]) pq.push(cnt[i]); } cout << ans << endl; } return 0; }