from __future__ import print_function # for PyPy2
from collections import Counter, OrderedDict
from itertools import permutations as perm
from collections import deque
from sys import stdin
from bisect import *
from heapq import *
import math
 
g   = lambda : stdin.readline().strip()
gl  = lambda : g().split()
gil = lambda : [int(var) for var in gl()]
gfl = lambda : [float(var) for var in gl()]
gcl = lambda : list(g())
gbs = lambda : [int(var) for var in g()]
mod = int(1e9)+7
inf = float("inf")

t, = gil()
for _ in range(t):
	n, = gil()
	a = gil()
	a = a[:(n//2)+1]
	prev = a.pop()
	while a and a[-1] == prev:
		a.pop()

	if a :
		i = 0
		while i+1 < len(a) and a[i+1] == a[0]:
			i+=1
		gIdx = i
		sIdx = 2*(gIdx+1)
		while sIdx+1 < len(a) and a[sIdx+1] == a[sIdx]:
			sIdx +=1 
		bIdx = sIdx+1
		if bIdx < len(a) and gIdx+1 < min(sIdx-gIdx, len(a)-bIdx):
			print(gIdx+1, sIdx-gIdx, len(a)-bIdx)
		else:
			print(0, 0, 0)

	else:
		print(0, 0, 0)
