#include <bits/stdc++.h>
using namespace std;
long long gcd(long long int a, long long int b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
long long lcm(int a, int b) { return (a / gcd(a, b)) * b; }
long long mfastPower(long long a, long long b, long long c) {
  long long res = 1;
  while (b > 0) {
    if ((b & 1) != 0) {
      res = ((res % c) * (a % c) % c);
    }
    a = ((a % c) * (a % c)) % c;
    b = b >> 1;
  }
  return res;
}
long long fastPower(long long a, long long b) {
  long long res = 1;
  while (b > 0) {
    if ((b & 1) != 0) {
      res = res * a;
    }
    a = a * a;
    b = b >> 1;
  }
  return res;
}
bool isPrime(long long n) {
  if (n <= 1) return false;
  if (n <= 3) return true;
  if (n % 2 == 0 || n % 3 == 0) return false;
  long long p = sqrt(n);
  for (int i = 5; i <= p; i = i + 6)
    if (n % i == 0 || n % (i + 2) == 0) return false;
  return true;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  long long t;
  cin >> t;
  while (t--) {
    long long n;
    cin >> n;
    long long a[n];
    for (int i = 0; i < n; i++) cin >> a[i];
    sort(a, a + n);
    long long ans = 0, cur = 0;
    for (int i = 0; i < n; i++) {
      if (++cur == a[i]) {
        ans++;
        cur = 0;
      }
    }
    cout << ans;
    cout << endl;
  }
  return 0;
}
