using System; using System.IO; using System.Text; using System.Linq; using System.Diagnostics; using System.Collections.Generic; using Enu = System.Linq.Enumerable; class Program { void Solve() { int T = reader.Int(); var ans = new List(); for (int t = 0; t < T; t++) { int N = reader.Int(); var L = reader.IntArray(N); ans.Add(Count(L)); } Console.WriteLine(string.Join("\n", ans)); } private int Count(int[] L) { var sorted = L.OrderBy(x => x).ToArray(); var distinct = sorted.Distinct().ToArray(); int N = distinct.Length; int[] rem = new int[N]; Array.ForEach(sorted, len => rem[Array.BinarySearch(distinct, len)]++); int res = 0; while (N >= 3) { Array.Sort(rem); if (rem[N - 3] == 0) break; res++; rem[N - 1]--; rem[N - 2]--; rem[N - 3]--; } return res; } static void Main() { new Program().Solve(); } Reader reader = new Reader(Console.In); class Reader { private readonly TextReader reader; private readonly char[] separator = { ' ' }; private readonly StringSplitOptions removeOp = StringSplitOptions.RemoveEmptyEntries; private string[] A = new string[0]; private int i; public Reader(TextReader r) { reader = r; } public bool HasNext() { return Enqueue(); } public string String() { return Dequeue(); } public int Int() { return int.Parse(Dequeue()); } public long Long() { return long.Parse(Dequeue()); } public double Double() { return double.Parse(Dequeue()); } public int[] IntLine() { var s = Line(); return s == "" ? new int[0] : Array.ConvertAll(Split(s), int.Parse); } public int[] IntArray(int N) { return Enu.Range(0, N).Select(i => Int()).ToArray(); } public int[][] IntGrid(int H) { return Enu.Range(0, H).Select(i => IntLine()).ToArray(); } public string[] StringArray(int N) { return Enu.Range(0, N).Select(i => Line()).ToArray(); } public string Line() { return reader.ReadLine().Trim(); } private string[] Split(string s) { return s.Split(separator, removeOp); } private bool Enqueue() { if (i < A.Length) return true; string line = reader.ReadLine(); if (line == null) return false; if (line == "") return Enqueue(); A = Split(line); i = 0; return true; } private string Dequeue() { Enqueue(); return A[i++]; } } }