1. #include <algorithm>
2. #include <set>
3. #include <sstream>
4. #include <stack>
5. #include <stdexcept>
6. #include <streambuf>
7. #include <string>
8. #include <utility>
9. #include <valarray>
10. #include <vector>
11. #include <cstring>
12. #include <cmath>
13. #include <array>
14. #include <cassert>
15. #include <random>
16. #include <chrono>
17. #include <bitset>
18. #include <complex>
19. #include <deque>
20. #include <exception>
21. #include <fstream>
22. #include <functional>
23. #include <iomanip>
24. #include <ios>
25. #include <iosfwd>
26. #include <iostream>
27. #include <istream>
28. #include <iterator>
29. #include <map>
30. #include <numeric>
31. #include <ostream>
32. #include <queue>
33.  
34. using namespace std;
35.  
36. #define BIT(i,j)  (((i)>>(j))&1LL;)
37. #define  MASK(i)  (1LL<<(i))
38. #define      pii  pair<int,int>
39. #define       fi  first
40. #define       se  second
41. #define       ll  long long
42. #define     endl  "n"
43. #define      int  ll
44.  
45. //-------------------------------------------------------------------------------------------------------//
46. template<typename T1, typename T2> bool mini(T1 &a, T2 b){if(a>b){a=b;return true;}return false;}
47. template<typename T1, typename T2> bool maxi(T1 &a, T2 b){if(a<b){a=b;return true;}return false;}
48. //-------------------------------------------------------------------------------------------------------//
49. const  ll   LINF = 1e18;
50. const int    INF = 1e9;
51. const int   MAXN = 5e5+7;
52. const int    MOD = 1e9+7;
53. //-------------------------------------------------------------------------------------------------------//
54.  
55. int cnt[MAXN];
56.  
57. void solve(){
58.     int n; cin >> n;
59.     for(int i = 1; i<=n; i++){
60.         int x; cin >> x;
61.         ++cnt[x];
62.     }
63.     int res = 0;
64.     for(int i = 1; i<=100; i++){
65.         res += cnt[i]/3;
66.         cnt[i] = 0;
67.     }
68.     cout << res << endl;
69. }
70.  
71. signed main(){
72.     ios_base::sync_with_stdio(0);
73.     cin.tie(0); cout.tie(0);
74.     #define task "test"
75.     if(fopen(task".inp","r")){
76.         freopen(task".inp","r",stdin);
77.         freopen(task".out","w",stdout);
78.     }
79.     int test = 1; cin >> test;
80.     while(test--) solve();
81.     return 0;
82. }