#include <bits/stdc++.h>
using namespace std;
array<int, 200000> e;
int solve(int n) {
  int next_team_size = 0;
  int team_count = 0;
  for (auto i = 0; i < n; i++) {
    next_team_size++;
    if (next_team_size == e[i]) {
      team_count++;
      next_team_size = 0;
    }
  }
  return team_count;
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  int t, n;
  scanf("%d", &t);
  while (--t >= 0) {
    scanf("%d", &n);
    for (auto i = 0; i < n; ++i) {
      scanf("%d", &e[i]);
    }
    sort(begin(e), begin(e) + n);
    printf("%d\n", solve(n));
  }
  return 0;
}
