#include <bits/stdc++.h>
const int N = 2e5 + 10;
int t, n, m, i, j, k, ans;
int a[N];
int main() {
  scanf("%d", &t);
  while (t--) {
    scanf("%d", &n);
    for (int i = 1; i <= n; i++) {
      scanf("%d", a + i);
    }
    std::sort(a + 1, a + n + 1);
    int ans = 0;
    for (int i = 1, cnt = 0; i <= n; i++) {
      cnt++;
      if (cnt == a[i]) {
        ans++;
        cnt = 0;
        continue;
      }
    }
    printf("%d\n", ans);
  }
  return 0;
}
