def s(n,l):
    A=[[] for i in range(n+1)];k=1
    for i in range(n-1):
        if l[i]==l[i+1]:k+=1
        else:A[l[i]]+=[k];k=1
    A[l[-1]]+=[k]
    N=[0]*(n+1)
    for i in range(1,n+1):
        if not A[i]:continue       
        p=[0]*(n+1);u=0;v=0
        for j in A[i]:p[j]+=1;u+=j;v+=1
        j=1
        while u:
            N[j]+=(v-1)*u-v*(v-1)//2-(v-1)*(j-1)*v
            N[j//2]+=u-(j-1)*v
            v-=p[j];u-=j*p[j];j+=1
    F=[N[n//2]]
    for i in range(n//2-1,0,-1):F=[N[i]+F[0]]+F
    return F
from sys import stdin;z=stdin.readline
for _ in range(int(input())):
    n=int(z());l=[*map(int,z().split())]
    print(*s(n,l))