from collections import Counter


def solve(N, L):
    c2 = Counter(Counter(L).values())
    ls = [0, 0, 0]
    for n in sorted(c2.keys(), reverse=True):
        k = c2[n]
        for i in range(k):
            ls.sort()
            ls[0] += n
    return min(ls)


def main():
    T = int(input())
    for t in range(T):
        N = int(input())
        L = list(map(int, input().split()))
        print(solve(N, L))


if __name__ == '__main__':
    main()