import java.util.*;
import java.io.*;
public class Main
{
    public static void main(String []args) throws IOException {
    	FastScanner in  = new FastScanner(System.in);
    	PrintWriter out = new PrintWriter(new BufferedWriter(new OutputStreamWriter(System.out)), false); 
    	solve(in, out);
    	in.close();
    	out.close();
    }
    static long gcd(long a, long b){ return (b==0) ? a : gcd(b, a%b); }
    static int gcd(int a, int b){ return (b==0) ? a : gcd(b, a%b); }
    static class FastScanner{
	BufferedReader reader;
	StringTokenizer st;
	FastScanner(InputStream stream){reader=new BufferedReader(new InputStreamReader(stream));st=null;}	
	String next(){while(st == null || !st.hasMoreTokens()){try{String line = reader.readLine();if(line == null){return null;}		    
	     st = new StringTokenizer(line);}catch (Exception e){throw new RuntimeException();}}return st.nextToken();}
	String nextLine()  {String s=null;try{s=reader.readLine();}catch(IOException e){e.printStackTrace();}return s;}	    	  	
	int    nextInt()   {return Integer.parseInt(next());}
	long   nextLong()  {return Long.parseLong(next());}		
	double nextDouble(){return Double.parseDouble(next());}
	char   nextChar()  {return next().charAt(0);}
	int[]  nextIntArray(int n)         {int[] arr= new int[n];   int i=0;while(i<n){arr[i++]=nextInt();}  return arr;}
	long[] nextLongArray(int n)        {long[]arr= new long[n];  int i=0;while(i<n){arr[i++]=nextLong();} return arr;}	
	int[]  nextIntArrayOneBased(int n) {int[] arr= new int[n+1]; int i=1;while(i<=n){arr[i++]=nextInt();} return arr;}	    	
	long[] nextLongArrayOneBased(int n){long[]arr= new long[n+1];int i=1;while(i<=n){arr[i++]=nextLong();}return arr;}	    	
	void   close(){try{reader.close();}catch(IOException e){e.printStackTrace();}}				
    }
    
    /********* SOLUTION STARTS HERE ************/
    
    private static void solve(FastScanner in, PrintWriter out){
        
        int T = in.nextInt();
        for(int t = 1; t <= T; t++)
        {
            int n = in.nextInt();
            int a[] = new int[n];
            int b[] = new int[n];
            int c[] = new int[n];
            for(int i=0;i<n;i++){
                a[i] = in.nextInt();
            }
            if(n<10) { out.println("0 0 0");continue; }
            int m = 0,tp = 1;
            b[0] = 1;
            for(int i = 0; i < n; i++){
                if(a[i]==a[m]) b[i]=tp;
                else{
                    m = i;
                    tp++;
                    b[i] = tp;
                }
            }
            int cnt = n/2;
            if(b[cnt] < 4) { out.println("0 0 0");continue; }
            int g=0,s=0,bb=0;
            int i=0;
            for(i=0;i<cnt;i++){
                if(b[i]==1) g++;
                else break;
            }
            int tmp = i;
            while(i<cnt){
                if(b[i]!=b[i+1] && s>=g) break;
                else ++s;
                ++i;
            }++s;++i;
            while(i<cnt && b[i]<b[cnt]){
                ++bb;
                ++i;
            }
            if(g>=s || g>=bb) out.println("0 0 0");
            else out.println(g+" "+s+" "+bb);
        }
    }
    
    /************* SOLUTION ENDS HERE **********/
}