#include <iostream>
#include <algorithm>
#include <map>
#include <queue>
using namespace std;

class range {private: struct I{int x;int operator*(){return x;}bool operator!=(I& lhs){return x<lhs.x;}void operator++(){++x;}};I i,n;
public:range(int n):i({0}),n({n}){}range(int i,int n):i({i}),n({n}){}I& begin(){return i;}I& end(){return n;}};

int nya(priority_queue<int> que) {
  if(que.size() < 3) { return 0; }
  int res = 0;
  while(!que.empty()) {
    int x = que.top(); que.pop();
    int y = que.top(); que.pop();
    int z = que.top(); que.pop();
    if(z == 0) { break; }
    res++;
    que.push(x-1);
    que.push(y-1);
    que.push(z-1);
  }
  return res;
}

int main(void) {
  int t; scanf("%d", &t);
  for(int times : range(t)) {
    int n; scanf("%d", &n);
    map<int, int> kort;
    for(int i : range(n)) {
      int x; scanf("%d", &x);
      kort[x]++;
    }
    priority_queue<int> que;
    for(auto kv : kort) {
      que.push(kv.second);
    }
    int res = nya(que);
    printf("%d\n", res);
  }
  return 0;
}