using System;

using System.Collections;
using System.Collections.Generic;
using System.Collections.Specialized;
using System.Text;
using System.Text.RegularExpressions;
using System.Linq;
using System.IO;

class Program
{
    static void Main(string[] args)
    {
        new Magatro().Solve();
    }
}

public class Scanner
{
    private StreamReader Sr;

    private string[] S;
    private int Index;
    private const char Separator = ' ';

    public Scanner(Stream source)
    {
        Index = 0;
        S = new string[0];
        Sr = new StreamReader(source);
    }

    private string[] Line()
    {
        return Sr.ReadLine().Split(Separator);
    }

    public string Next()
    {
        string result;
        if (Index >= S.Length)
        {
            S = Line();
            Index = 0;
        }
        result = S[Index];
        Index++;
        return result;
    }
    public int NextInt()
    {
        return int.Parse(Next());
    }
    public double NextDouble()
    {
        return double.Parse(Next());
    }
    public long NextLong()
    {
        return long.Parse(Next());
    }
    public decimal NextDecimal()
    {
        return decimal.Parse(Next());
    }
    public string[] StringArray(int index = 0)
    {
        Next();
        Index = S.Length;
        return S.Skip(index).ToArray();
    }
    public int[] IntArray(int index = 0)
    {
        return StringArray(index).Select(int.Parse).ToArray();
    }
    public long[] LongArray(int index = 0)
    {
        return StringArray(index).Select(long.Parse).ToArray();
    }
    public bool EndOfStream
    {
        get { return Sr.EndOfStream; }
    }
}

public class Magatro
{
    private Scanner Cin;

    private int T;

    private void Scan()
    {
        Cin = new Scanner(Console.OpenStandardInput());
    }
    public void Solve()
    {
        Scan();
        T = Cin.NextInt();
        for (int i = 0; i < T; i++)
        {
            Anser(Cin.NextInt(), Cin.IntArray());
        }
    }

    private void Anser(int n, int[] l)
    {
        if (n < 3)
        {
            Console.WriteLine(0);
            return;
        }
        var map = new Dictionary<int, int>();
        int t;
        foreach (int i in l)
        {
            if(map.TryGetValue(i ,out t))
            {
                map[i]++;
            }
            else
            {
                map.Add(i, 1);
            }
        }
        if (map.Count < 3)
        {
            Console.WriteLine(0);
            return;
        }
        var pq = new PriortyQueue<int>((a, b) => a.CompareTo(b));
        foreach (var a in map)
        {
            pq.Add(a.Value);
        }
        int result = 0;
        while (true)
        {
            int a, b, c;
            a = pq.Poll();
            b = pq.Poll();
            c = pq.Poll();
            if (c <= 0)
            {
                Console.WriteLine(result);
                return;
            }
            result++;
            pq.Add(a - 1);
            pq.Add(b - 1);
            pq.Add(c - 1);
        }
    }

}

public class PriortyQueue<T>
{
    private Comparison<T> Comparator;
    private List<T> L;
    public PriortyQueue(Comparison<T> comparator)
    {
        Clear();
        Comparator = comparator;
    }
    public PriortyQueue(PriortyQueue<T> queue)
    {
        L = queue.ToList();
        Comparator = queue.Comparator;
    }
    public void Add(T item)
    {
        int n = L.Count;
        L.Add(item);
        while (n > 0)
        {
            int i = (n - 1) / 2;
            if (Comparator(L[n], L[i]) > 0)
            {
                Swap(n, i);
            }
            n = i;
        }
    }
    public T Poll()
    {
        T ret = Peak();
        Pop();
        return ret;
    }
    public void Pop()
    {
        int n = L.Count - 1;
        L[0] = L[n];
        L.RemoveAt(n);
        for (int i = 0, j; (j = 2 * i + 1) < n;)
        {
            if ((j != n - 1) && (Comparator(L[j], L[j + 1]) < 0))
            {
                j++;
            }

            if (Comparator(L[i], L[j]) < 0)
            {
                Swap(i, j);
            }
            i = j;
        }
    }
    public T Peak()
    {
        return L[0];
    }
    public T[] ToArray()
    {
        return L.ToArray();
    }
    public List<T> ToList()
    {
        return L.ToList();
    }
    public void Clear()
    {
        L = new List<T>();
    }
    public int Size
    {
        get { return L.Count; }
    }
    public bool IsEmpty
    {
        get { return L.Count == 0; }
    }
    private void Swap(int a, int b)
    {
        T temp = L[a];
        L[a] = L[b];
        L[b] = temp;
    }
}