#include <bits/stdc++.h>
using namespace std;
void solve() {
  long long n;
  cin >> n;
  vector<long long> arr(n);
  for (long long i = 0; i < n; ++i) {
    cin >> arr[i];
  }
  sort(arr.begin(), arr.end());
  long long grp = 0;
  long long ptr = 0;
  unordered_map<long long, long long> mp;
  long long last = 0;
  for (long long i = 0; i < n; ++i) {
    if (arr[i] == 1) {
      grp++;
      continue;
    } else if (ptr > 0) {
      ptr--;
      if (ptr == 0 && arr[i] == arr[i - 1]) {
        grp++;
      } else {
        ptr = arr[i] - (i - last + 1);
      }
    } else {
      ptr = arr[i] - 1;
      last = i;
    }
  }
  cout << grp << "\n";
}
int32_t main() {
  long long t;
  cin >> t;
  while (t--) {
    solve();
  }
}
