#include <bits/stdc++.h>
using namespace std;
void solve() {
  int n;
  cin >> n;
  vector<int> a(n);
  for (int i = 0; i < n; i++) cin >> a[i];
  sort(a.begin(), a.end());
  int cnt = 0;
  int maxi = INT_MIN, j = 0;
  for (int i = 0; i < n; i++) {
    maxi = max(maxi, a[i]);
    if (i - j + 1 >= maxi) {
      maxi = INT_MIN;
      j = i + 1;
      cnt++;
    }
  }
  cout << cnt << endl;
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  int t = 1, i = 0;
  cin >> t;
  while (t--) {
    solve();
  }
  return 0;
}
