t = gets.to_i
t.times do 
    n = gets.to_i
    a = gets.split.map(&:to_i)
    h1 = Hash.new(0)
    n.times do |i|
        h1[a[i]] += 1
    end
    res = 0
    count = 0
    h1 = h1.sort_by{ |key, val| -val}
    while true do
        count = 0
        find = false
        h1.length.times do |k|
            if h1[k][1] <= 0
                next
            end
            h1[k][1] -= 1
            count += 1
            if count >= 3
                res += 1
                find = true
                break
            end
        end
        h1.sort!{ |a, b| b[1] <=> a[1] }
        if !find
            break
        end
    end
    puts res
end