#include <bits/stdc++.h>
using namespace std;
int main() {
  int t;
  cin >> t;
  while (t--) {
    int n, mx = 0;
    cin >> n;
    vector<int> inp(n), dp(n + 1, 0);
    for (int i = 0; i < n; i++) cin >> inp[i];
    sort(inp.begin(), inp.end());
    int cnt = 0;
    for (int i = 1; i <= n; i++) {
      if (i - inp[i - 1] >= 0) dp[i] = dp[i - inp[i - 1]] + 1;
      dp[i] = max(dp[i], dp[i - 1]);
      mx = max(mx, dp[i]);
    }
    cout << mx << endl;
  }
  return 0;
}
