#include <bits/stdc++.h>
using namespace std;
long long mx = -1e9, mn = 1e9;
long long T, n, m, k, a[5000005], x, y, ans, l, r, sum;
long long one = 1;
vector<long long> v;
map<long long, long long> mp;
map<long long, long long>::iterator it;
queue<long long> q;
int main() {
  scanf("%lld", &T);
  while (T--) {
    mp.clear();
    scanf("%lld", &n);
    for (int i = 1; i <= n; i++) {
      cin >> a[i];
    }
    sort(a + 1, a + n + 1);
    sum = 0;
    ans = 0;
    for (int i = 1; i <= n; i++) {
      sum++;
      if (sum >= a[i]) {
        ans++;
        sum = 0;
      }
    }
    cout << ans << endl;
  }
}
