#define _USE_MATH_DEFINES
#include <algorithm>
#include <cstdio>
#include <functional>
#include <iostream>
#include <cfloat>
#include <climits>
#include <cstring>
#include <cmath>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <time.h>
#include <vector>
using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> i_i;
typedef pair<ll, int> ll_i;
typedef pair<double, int> d_i;
typedef pair<ll, ll> ll_ll;
typedef pair<double, double> d_d;
struct edge { int u, v, w; };

ll MOD = 1000000007;
ll _MOD = 1000000009;
double EPS = 1e-10;
int INF = INT_MAX / 2;

int main() {
	int T; cin >> T;
	while (T--) {
		int N; cin >> N;
		vector<int> L(N);
		for (int i = 0; i < N; i++)
			cin >> L[i];
		sort(L.begin(), L.end());
		vector<int> a(100);
		for (int i = 0; i < N; i++) {
			int j = lower_bound(L.begin(), L.end(), L[i]) - L.begin();
			a[j]++;
		}
		int cnt = 0;
		for (;;) {
			sort(a.begin(), a.end(), greater<int>());
			if (a[0] && a[1] && a[2]) {
				cnt++;
				a[0]--; a[1]--; a[2]--;
			}
			else break;
		}
		cout << cnt << endl;
	}
}