#include <bits/stdc++.h>
using namespace std;

#define int long long
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define repi(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
#define all(x) (x).begin(),(x).end()
#define pb push_back
#define mp make_pair
#define mt make_tuple

typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<vi> vvi;

const int inf = 1LL<<60;
const int mod = 1e9 + 7;
const double eps = 1e-9;

/*{
}*/

signed main()
{
  int t;
  cin >> t;

  while(t--){
    int n;
    cin >> n;

    vi L(n);
    map<int, int> cnt;
    rep(i, n){
      cin >> L[i];
      cnt[L[i]]++;
    }

    if(cnt.size() < 3){
      cout << 0 << endl;
      continue;
    }

    priority_queue<int> que;
    for(auto it : cnt){
      que.push(it.second);
    }

    int ans = 0;
    while(1){
      int a = que.top(); que.pop();
      int b = que.top(); que.pop();
      int c = que.top(); que.pop();
      if(c <= 0){
        break;
      }
      ans++;
      que.push(a-1);
      que.push(b-1);
      que.push(c-1);
    }
    cout << ans << endl;
  }

  return 0;
}