from heapq import heappop,heappush
import collections
T=int(raw_input())
for ti in range(T):
    N=int(raw_input())
    L=map(int,raw_input().split())
    LDict=collections.Counter(L)
    hp=[]
    for v,n in LDict.items():
        heappush(hp,-n)
    ans=0
    while len(hp)>=3:
        a=heappop(hp)
        b=heappop(hp)
        c=heappop(hp)
        ans+=1
        if a+1<0:
            heappush(hp,a+1)
        if b+1<0:
            heappush(hp,b+1)
        if c+1<0:
            heappush(hp,c+1)
    print ans