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

using namespace std;

int maxCount(const vector<int>& l) {
	map<int, int> valueToCount;
	for (size_t i = 0; i < l.size(); ++i) {
		++valueToCount[l[i]];
	}
	vector<int> counts;
	for (map<int, int>::const_iterator it = valueToCount.begin();
		it != valueToCount.end();
		++it) {
		counts.push_back(it->second);
	}
	if (counts.size() < 3) {
		return 0;
	}
	int result = 0;
	for (;;) {
		sort(counts.begin(), counts.end(), greater<int>());
		if (counts[2] == 0) {
			break;
		}
		for (int i = 0; i < 3; ++i) {
			--counts[i];
		}
		++result;
	}
	return result;
}

int main() {
	int t;
	cin >> t;
	for (int i = 0; i < t; ++i) {
		int n;
		cin >> n;
		vector<int> l(n);
		for (int k = 0; k < n; ++k) {
			cin >> l[k];
		}
		cout << maxCount(l) << endl;
	}
	return 0;
}