/* -*- coding: utf-8 -*-
 *
 * 120.cc: No.120 傾向と対策:門松列(その1) - yukicoder
 */

#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<iostream>
#include<string>
#include<vector>
#include<map>
#include<set>
#include<stack>
#include<list>
#include<queue>
#include<deque>
#include<algorithm>
#include<numeric>
#include<utility>
#include<complex>
#include<functional>
 
using namespace std;

/* constant */

const int MAX_N = 100;

/* typedef */

/* global variables */

int ls[MAX_N], cs[MAX_N], ds[MAX_N];

/* subroutines */

/* main */

int main() {
  int tn;
  cin >> tn;

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

    for (int i = 0; i < n; i++) cin >> ls[i];
    sort(ls, ls + n);

    int cn = 0, pl = 0, maxc = 0;
    for (int i = 0; i < n; i++) {
      if (pl != ls[i]) cs[cn++] = 1;
      else cs[cn - 1]++;
      pl = ls[i];
      if (maxc < cs[cn - 1]) maxc = cs[cn - 1];
    }
    //for (int i = 0; i < cn; i++) printf("%d ", cs[i]); putchar('\n');

    memset(ds, 0, sizeof(ds));
    for (int i = 0; i < cn; i++) ds[cs[i] - 1]++;
    //for (int i = 0; i < maxc; i++) printf("%d ", ds[i]); putchar('\n');

    int cnt = 0;
    for (;;) {
      while (maxc > 0 && ds[maxc - 1] == 0) maxc--;

      int k = 3, c = maxc - 1, es[3];
      for (int i = 0; i < 3 && c >= 0;) {
	if (ds[c] > 0) {
	  ds[c]--;
	  es[i++] = c;
	}
	else c--;
      }
      if (c < 0) break;

      cnt++;
      for (int i = 0; i < 3; i++)
	if (es[i] > 0) ds[es[i] - 1]++;
    }

    printf("%d\n", cnt);
  }
  return 0;
}