#include <bits/stdc++.h>
using namespace std;
void solve() {
  int n;
  cin >> n;
  int a[n];
  for (int i = 0; i < n; i++) cin >> a[i];
  sort(a, a + n);
  int res = 0;
  int size = 1;
  for (int i = 0; i < n; i++) {
    if (a[i] <= size) {
      res++;
      size = 1;
    } else {
      size++;
    }
  }
  cout << res << endl;
}
int main() {
  int t;
  cin >> t;
  while (t--) solve();
  return 0;
}
