#include <bits/stdc++.h>
using namespace std;
int f(long long int n) {
  if (n > 1) {
    long long int f = 1;
    for (long long int i = 2; i <= n; i++) f = f * i;
    return f;
  } else
    return 1;
}
bool isprime(long long int n) {
  if (n == 1)
    return false;
  else {
    for (long long int i = 2; i <= sqrt(n); i++)
      if (n % i == 0) return false;
    return true;
  }
}
vector<pair<long long int, long long int> > primefac(long long int n) {
  vector<pair<long long int, long long int> > a;
  long long int temp, test = 1, count;
  for (long long int i = 2; i <= sqrt(n); i++) {
    if (n % i == 0 && isprime(i)) {
      temp = n;
      count = 0;
      while (temp % i == 0) {
        count++;
        temp = temp / i;
      }
      a.push_back({i, count});
      test = pow(i, count) * test;
    }
  }
  if (test != n) a.push_back({n / test, 1});
  return a;
}
vector<long long int> fac(long long int n) {
  vector<long long int> a;
  for (long long int i = 1; i <= sqrt(n); i++) {
    if (n % i == 0) {
      if (i != n / i) {
        a.push_back(i);
        a.push_back(n / i);
      } else
        a.push_back(i);
    }
  }
  return a;
}
bool sortbysec(const pair<long long int, long long int> &a,
               const pair<long long int, long long int> &b) {
  return (a.second < b.second);
}
long long int gcd(long long int a, long long int b) {
  if (a == 0)
    return b;
  else if (b == 0)
    return a;
  else
    return gcd(b % a, a);
}
long long int ncr(long long int n, long long int r) {
  return (f(n) / (f(r) * f(n - r)));
}
vector<int> primev;
void SieveOfEratosthenes(int n) {
  bool prime[n + 1];
  memset(prime, true, sizeof(prime));
  for (int p = 2; p * p <= n; p++) {
    if (prime[p] == true) {
      for (int i = p * p; i <= n; i += p) prime[i] = false;
    }
  }
  for (int p = 2; p <= n; p++)
    if (prime[p]) primev.push_back(p);
}
void solve() {
  long long int n;
  cin >> n;
  long long int a[n];
  for (long long int i = 0; i < n; i++) cin >> a[i];
  sort(a, a + n);
  long long int s = 0, ans = 0;
  for (long long int i = 0; i < n; i++) {
    if (++s == a[i]) {
      ans++;
      s = 0;
    }
  }
  cout << ans << "\n";
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  int t;
  cin >> t;
  while (t--) {
    solve();
  }
  return 0;
}
