#include <cstdio>
#include <algorithm>
#include <map>

using namespace std;

int n;
int l[111];
int a[111], c;

void solve() {
  scanf("%d", &n);
  for (int i = 0; i < n; i++) scanf("%d", l+i);
  sort(l, l+n);
  int res = 0;
  for(;;) {
    /*
    for (int i = 0; i < n; i++) {
      printf("%d ", l[i]);
    }
    puts("");
    */
    map<int, int> v;
    for (int i = 0; i < n; i++) {
      if (l[i] > 0) v[l[i]]++;
    }
    c = 0;
    for (auto&& p : v) a[c++] = p.first;
    if (c < 3) break;
    res += 1;
    int idx = 0;
    c = 0;
    for (auto&& p : v) {
      if (idx++ < 3) p.second--;
      for (int i = 0; i < p.second; i++) {
        l[c++] = p.first;
      }
    }
    n = c;
  }
  printf("%d\n", res);
}

int main(void) {
  int T;
  scanf("%d", &T);
  for (int i = 0; i < T; i++) {
    solve();
  }
  return 0;
}