#include<bits/stdc++.h>
using namespace std;
#define rep(i,x,y) for (int i=(x);i<=(y);i++)
#define drep(i,y,x) for (int i=(y);i>=(x);i--)
#define pii pair<int,int>
#define fir first
#define sec second
#define MP make_pair
template<typename T> bool chkmin(T &x,T y){return x>y?x=y,1:0;}
template<typename T> bool chkmax(T &x,T y){return x<y?x=y,1:0;}
void file() {
    #ifdef zqj
    freopen("a.in","r",stdin);
    #endif
}
typedef long long ll;
#define sz 333333

int n;
int a[sz],b[sz],cc[sz];

void work() {
    cin>>n;
    rep(i,1,n) cin>>a[i],cc[i]=0;
    sort(a+1,a+n+1);
    int m=0;
    for (int l=1,r;l<=n;l=r+1) {
        for (r=l;r<n&&a[r]==a[r+1];++r);
        cc[++m]=r-l+1;
    }
    int ans=cc[m]; cc[m]=0,--m;
    if (!m) return cout<<n<<'\n',void();
    n-=ans;
    priority_queue<int>q;
    int c1=0,c2=0,tot=0;
    drep(i,m,1) {
        q.push(cc[i]); c1+=cc[i];
        if (c1>c2) {
            int t=q.top(); q.pop();
            ++c2; c1-=t;
            tot+=t;
            if (c2>n-tot) {
                tot=n-c2;
                cout<<ans+tot<<'\n';
                return;
            }
        }
    }
    cout<<ans+tot<<'\n';
}

int main() {
    file();
    ios::sync_with_stdio(false),cin.tie(0);
    int T; cin>>T;
    while (T--) work();
    return 0;
}