from sys import stdin
from bisect import bisect_left
test_cases=True

if test_cases:
    t=int(stdin.readline())
    while t:
        n=int(input())
        p=list(map(int,stdin.readline().split()))
        g,s,b=0,0,0
        if n>3:
            g=1
            for i in range(1,n//2+1):
                if p[i]==p[i-1]:
                    g+=1
                else:
                    break
            
            if i<n//4:
                s=1
                for j in range(i+1,n//2+1):
                    if p[j]==p[j-1] or s<=g:
                        s+=1
                    else:
                        break
                if g+s<n//2:
                    b=1
                    temp=j
                    for k in range(j+1,n//2+1):
                        if g+s+b==n//2:
                            break
                        if p[k]!=p[k-1]:
                            temp=k
                        b+=1
                    if p[k]==p[temp]:
                        b-=(k-temp)
        if g==0 or b==0 or s==0:
            g,s,b=0,0,0
        print(g,s,b)
        t-=1
else:
    k,n=map(int,stdin.readline().split())