#include <iostream>
#include <algorithm>
#include <vector>
#include <map>

using lint = long long;

void solve() {
    std::map<int, int> cnt;

    int n;
    std::cin >> n;

    for (int i = 0; i < n; ++i) {
        int x;
        std::cin >> x;

        if (!cnt.count(x)) cnt[x] = 0;
        ++cnt[x];
    }

    int ok = 0, ng = n;
    while (ng - ok > 1) {
        int mid = (ok + ng) / 2;

        int sum = 0;
        for (auto p : cnt) {
            sum += std::min(mid, p.second);
        }

        if (sum >= mid * 3) {
            ok = mid;
        } else {
            ng = mid;
        }
    }

    std::cout << ok << std::endl;
}

int main() {
    std::cin.tie(nullptr);
    std::ios::sync_with_stdio(false);

    int q;
    std::cin >> q;
    while (q--) solve();

    return 0;
}