#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;

queue<ll> q;

int main()
{
	int T;  cin >> T;
	for (int i = 0; i < T; i++) {
		map<ll, ll> m;
		int N;  cin >> N;
		ll L[101], num = 1, ans = 0;
		for (int j = 0; j < N; j++) {
			cin >> L[j];
			q.push(L[j]);
		}

		ll cnt = 0,a[3],j = 0;
		for (int i = 0; i < 1000; i++) {
			ll num = 0;
			if (!q.empty()) {
				num = q.front(); q.pop();
			}
			else
				break;
			if (num != 0) {
				if (m[num] != 1) {
					m[num] = 1;
					a[j++] = num;
					cnt++;
				}
				else {
					q.push(num);
				}
				if (cnt >= 3) {
					ans++;
					cnt = 0;
					j = 0;
					for (int k = 0; k < 3; k++) {
						m[a[k]] = 0;
					}
				}
			}
		}
		cout << ans <<  endl;
		}
	return	0;
}