#include <bits/stdc++.h>
using namespace std;
const long long int MOD = 1e9 + 7;
const long long int inf = 1LL << 62;
void fast_io() {
  ios::sync_with_stdio(false);
  cin.tie(0);
}
vector<long long int> dp(200007), v(200007);
int32_t main() {
  fast_io();
  long long int n, k, ans;
  long long int t;
  cin >> t;
  while (t--) {
    cin >> n;
    v[0] = 0;
    for (long long int i = 1; i < n + 1; i++) {
      cin >> v[i];
    }
    sort(v.begin(), v.begin() + n + 1);
    ans = 1;
    for (long long int i = 1; i < n + 1; i++) {
      dp[i] = 0;
      if (i >= v[i]) {
        dp[i] = dp[i - v[i]] + 1;
      } else {
        dp[i] = dp[i - 1];
      }
      ans = max(dp[i], ans);
    }
    cout << ans << endl;
  }
  return 0;
}
