#include <algorithm>
#include <iostream>
#include <cstdio>
#include <map>
#include <numeric>
#include <cmath>
#include <set>
#include <sstream>
#include <string>
#include <vector>
#include <queue>
#include <stack>
#include <complex>
#include <string.h>
#include <unordered_set>
#include <unordered_map>
#include <bitset>
#include <iomanip>
#include <sys/time.h>
#include <random>
using namespace std;

#define endl '\n'
#define ALL(v) (v).begin(), (v).end()
#define RALL(v) (v).rbegin(), (v).rend()
#define UNIQ(v) (v).erase(unique((v).begin(), (v).end()), (v).end())

typedef long long ll;
typedef long double ld;
typedef pair<int, int> P;
typedef complex<double> comp;
typedef vector< vector<ld> > matrix;
struct pairhash {
public:
    template<typename T, typename U>
    size_t operator()(const pair<T, U> &x) const {
	size_t seed = hash<T>()(x.first);
	return hash<U>()(x.second) + 0x9e3779b9 + (seed<<6) + (seed>>2);
    }
};
const int inf = 1e9 + 9;
const ll mod = 1e9 + 7;
const double eps = 1e-8;
const double pi = acos(-1);

int n;
int l[110];

int solve() {
    sort(l, l+n);    
    priority_queue<int> que;
    int idx = 0;
    while (idx < n) {
        int c = 0;
        while (idx+c<n && l[idx] == l[idx+c]) c++;
        que.push(c);
        idx += c;
    }

    int res = 0;
    while (que.size() >= 3) {
        int a = que.top(); que.pop();
        int b = que.top(); que.pop();
        int c = que.top(); que.pop();
        res++;
        if (a > 1) que.push(a-1);
        if (b > 1) que.push(b-1);
        if (c > 1) que.push(c-1);
    }
    return res;
}

void input() {
    cin >> n;
    for (int i = 0; i < n; i++) cin >> l[i];
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout << fixed << setprecision(15);

    int t;
    cin >> t;
    for (int i = 0; i < t; i++) {
        input();
        cout << solve() << endl;
    }
}