#include <bits/stdc++.h>
using namespace std;
int main() {
  int t;
  cin >> t;
  while (t--) {
    long long int n;
    cin >> n;
    vector<int> vec;
    long long int val;
    map<long long int, long long int> mp;
    unordered_set<long long int> store;
    long long int count = 0;
    for (long long int i = 0; i < n; i++) {
      cin >> val;
      vec.push_back(val);
    }
    sort(vec.begin(), vec.end());
    int result = 0;
    for (int i = 0; i < n; i++) {
      if (++count == vec[i]) {
        result++;
        count = 0;
      }
    }
    cout << result << "\n";
  }
}
