//code by Sounak, IIEST
import java.io.*;
import java.math.*;
import java.util.*;
import java.util.Arrays;
public class Test3{
    public static void main(String args[])throws IOException{
        Scanner sc=new Scanner(System.in);
        int test=sc.nextInt();
        while(--test>=0)
        {
            int n=sc.nextInt();
            int p[]=new int[n];
            int a[]=new int[n];
            int i,in=0,count=1;
            for(i=0;i<n;i++)
            p[i]=sc.nextInt();
            a[0]=1;
            for(i=1;i<n;i++)
            {
                if(p[i]==p[i-1])
                count++;
                else
                {
                    a[in]=count;
                    in++;
                    count=1;
                    if(i>=n/2)
                    break;
                }
            }
            /*
            int j;
            for(j=0;j<in;j++)
            System.out.println(a[j]);
            System.out.println(i);
            */
            int g=0,s=0,b=0;
            if(i>n/2)
            {
                in--;
            }
            g=a[0];
            //System.out.println(in);
            //System.out.println(g);
            count=in;
            for(i=1;i<in;i++)
            {
                s+=a[i];
                if(s>g)
                {
                    count=i+1;
                    break;
                }
            }
            //System.out.println(s+" "+count);
            for(i=count;i<in;i++)
            {
                b+=a[i];
            }
            //System.out.println(b);
            if(g<s && g<b && g>0 && b>0 && s>0 && (g+s+b)<=n/2)
            System.out.println(g+" "+s+" "+b);
            else
            System.out.println("0 0 0");
        }
    }
}