#include <algorithm>
#include <cstdio>
#include <iostream>
#include <map>
#include <cmath>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#include <stdlib.h>
#include <stdio.h>
#include <bitset>
using namespace std;
#define FOR(I,A,B) for(int I = (A); I < (B); ++I)
typedef long long ll;

int main(){
  int T;
  cin >> T;
  while(T--) {
    int N;
    cin >> N;
    vector<int> L(N);
    map<int, int> M;
    FOR(i,0,N) {
      cin>>L[i];
      M[L[i]]++;
    }
    int ans = 0;
    priority_queue<int> Q;
    for(auto x : M) Q.push(x.second);
    if(M.size()>=3) {
      while(!Q.empty()) {
        int a = Q.top();Q.pop();
        int b = Q.top();Q.pop();
        int c = Q.top();Q.pop();
        ans += c;
        if(c <= 0) break;
        Q.push(a-c);
        Q.push(b-c);
        Q.push(0);
      }
    }
    printf("%d\n", ans);
  }
}