#include <bits/stdc++.h>
using namespace std;

int main() {
	int T;
	cin >> T;
	while (T--) {
		int n;
		cin >> n;
		vector<int> a(n);
		for (int i = 0; i < n; i++) {
			scanf("%d", &a[i]);
		}
		sort(a.begin(), a.end());
		int ans = 0;
		while (true) {
			int j = -1;
			for (int i = 1; i < (int)a.size() - 1; i++) {
				if (a.front() != a[i] && a[i] != a.back()) {
					j = i;
					break;
				}
			}
			if (j == -1) {
				break;
			}
			ans++;
			a.pop_back();
			a.erase(a.begin() + j);
			a.erase(a.begin());
		}
		cout << ans << endl;
	}
}