t = int(input())
from collections import Counter
import heapq
for _ in range(t):
    n = int(input())
    L = list(map(int, input().split()))
    C = Counter(L)
    q = []
    for k, v in C.items():
        q.append((-v, k))
    heapq.heapify(q)
    ans = 0
    while len(q) >= 3:
        v1, k1 = heapq.heappop(q)
        v2, k2 = heapq.heappop(q)
        v3, k3 = heapq.heappop(q)
        v1, v2, v3 = -v1, -v2, -v3
        if v1 > 1:
            heapq.heappush(q, (-(v1-1), k1))
        if v2 > 1:
            heapq.heappush(q, (-(v2-1), k2))
        if v3 > 1:
            heapq.heappush(q, (-(v3-1), k3))
        ans += 1
    print(ans)