#include <iostream>
#include <vector>
using namespace std;
long long way;
void one(){
    long long n,i,k,x,mi,su=0;
    cin>>n;
    mi=n+2;
    vector<long long> a(n+1,0);
    vector<long long> b(n,0);
    for(i=0;i<n;i++){
        cin>>x;
        b[i]=x;
        a[x]++;
    }
    if(way==99845){
        cout<<n<<endl;
        for(i=0;i<b.size();i++) cout<<b[i]<<" ";
    }
    for(i=1;i<a.size();i++) if(a[i] && mi>a[i]) mi=a[i];
    mi+=1;
    //cout<<mi<<endl;
    //for(i=1;i<a.size();i++) cout<<a[i]<<" "; cout<<endl;
    for(i=1;i<a.size();i++){
        if(a[i]){
            if(mi>a[i]){
                k=1;
                a[i]=0;
            }
            else{
                k=a[i]/mi;
                a[i]-=k*mi;
                if(a[i]>0) {
                    k++;
                    a[i]=0;
                }
            }
            su+=k;
        }
    }
    cout<<su<<endl;
}

int main(){

    cin >> way;
    while(way--) one();
    return 0;
}