#include <algorithm>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <utility>
#include <valarray>
#include <vector>
#include <cstring>
#include <cmath>
#include <array>
#include <cassert>
#include <random>
#include <chrono>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <map>
#include <numeric>
#include <ostream>
#include <queue>

using namespace std;

#define BIT(i,j)  (((i)>>(j))&1LL;)
#define  MASK(i)  (1LL<<(i))
#define      pii  pair<int,int>
#define       fi  first
#define       se  second
#define       ll  long long
#define     endl  "n"
#define      int  ll

//-------------------------------------------------------------------------------------------------------//
template<typename T1, typename T2> bool mini(T1 &a, T2 b){if(a>b){a=b;return true;}return false;}
template<typename T1, typename T2> bool maxi(T1 &a, T2 b){if(a<b){a=b;return true;}return false;}
//-------------------------------------------------------------------------------------------------------//
const  ll   LINF = 1e18;
const int    INF = 1e9;
const int   MAXN = 5e5+7;
const int    MOD = 1e9+7;
//-------------------------------------------------------------------------------------------------------//

int cnt[MAXN];

void solve(){
    int n; cin >> n;
    for(int i = 1; i<=n; i++){
        int x; cin >> x;
        ++cnt[x];
    }
    int res = 0;
    for(int i = 1; i<=100; i++){
        res += cnt[i]/3;
        cnt[i] = 0;
    }
    cout << res << endl;
}

signed main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
    #define task "test"
    if(fopen(task".inp","r")){
        freopen(task".inp","r",stdin);
        freopen(task".out","w",stdout);
    }
    int test = 1; cin >> test;
    while(test--) solve();
    return 0;
}