import collections

def solve(N, L):
    c = collections.Counter()
    for Li in L:
        c[Li] += 1
    cnt = list(c.values())

    if len(cnt) < 3:
        return 0

    res = 0
    while True:
        cnt.sort(reverse=True)
        if cnt[0] > 0 and cnt[1] > 0 and cnt[2] > 0:
            res += 1
            cnt[0] -= 1
            cnt[1] -= 1
            cnt[2] -= 1
        else:
            break

    return res


T = int(input())
lis = [0] * T
for tt in range(T):
    nt = int(input())
    lt = [int(x) for x in input().split()]
    lis[tt] = solve(nt, lt)

print(*lis, sep='\n')