#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
const int BUF = 105;


int N;
int vList[BUF];

void read() {
    cin >> N;
    for (int i = 0; i < N; ++i)
        cin >> vList[i];
}


void work() {
    sort(vList, vList + N);
    
    vector<int> cntList;
    
    for (int idx = 0; idx < N; ++idx) {
        int cnt = 1;
        while (idx + 1 < N && vList[idx + 1] == vList[idx]) {
            ++idx;
            ++cnt;
        }
        cntList.push_back(cnt);
    }

    int ans = 0;
    while (cntList.size() >= 3) {
        if (cntList[0] == 0) {
            cntList.erase(cntList.begin());
            continue;
        }
        
        if (cntList[1] == 0) {
            cntList.erase(cntList.begin() + 1);
            continue;
        }
        
        if (cntList[2] == 0) {
            cntList.erase(cntList.begin() + 2);
            continue;
        }
        
        --cntList[0];
        --cntList[1];
        --cntList[2];
        ++ans;
    }
    
    cout << ans << endl;
}


int main() {
    int cases;
    cin >> cases;
    for (int i = 0; i < cases; ++i) {
        read();
        work();
    }
    return 0;
}