#include<cstdio>
#include<iostream>
#include<algorithm>
#include<string>
#include<queue>
#include<vector>
#include<functional>
#include<cmath>
#include<map>
#include<stack>
#include<set>
#include<numeric>
#include<limits>

#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()

using namespace std;
typedef long long ll;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
typedef pair<ll, string> pls;

int main()
{
	int T;  cin >> T;
	for (int i = 0; i < T; i++) {
		int N;  cin >> N;
		ll L[101], num = 1, ans = 0;
		for (int j = 0; j < N; j++) {
			cin >> L[j];
		}
		sort(L, L + N);
		for (int j = 1; j < N - 1; j++) {
			if (L[j] != L[j - 1])num++;
		}
		ll a = num, b = N - num;
		while (a >= 2 && b >= 1) {
			a -= 2;
			b -= 1;
			ans++;
		}
		if (a >= 3)ans += a / 3;
		cout << ans << endl;
	}
	return	0;
}