#include <bits/stdc++.h>
using namespace std;
using namespace std::chrono;
long long mod = 1e9 + 7;
long long mod2 = 998244353;
long long powm(long long a, long long b, long long md = mod) {
  b = b / md + b % md;
  long long ans = 1;
  while (b > 0) {
    if (b & 1) ans = (ans * a) % md;
    a = (a * a) % md;
    b = b >> 1;
  }
  return ans;
}
void solve() {
  long long n;
  cin >> n;
  long long a[n];
  for (long long i = 0; i < n; i++) cin >> a[i];
  sort(a, a + n);
  long long cnt = 0;
  long long cur = 0;
  for (long long i = 0; i < n; i++) {
    cur++;
    if (cur >= a[i]) {
      cnt++;
      cur = 0;
    }
  }
  cout << cnt << '\n';
}
signed main() {
  auto start = high_resolution_clock::now();
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  cout << fixed << setprecision(15);
  long long t = 1;
  cin >> t;
  while (t--) solve();
  auto stop = high_resolution_clock::now();
  auto duration = duration_cast<microseconds>(stop - start);
  cerr << "duration.count()"
       << " is " << duration.count() << '\n';
  ;
  return 0;
}
