import java.util.Scanner;

public class beautifulRegional {
    public static void main(String[] args) {
        Scanner s = new Scanner(System.in);
        int t = s.nextInt();
        for(int i =0; i < t; i++) {
            int n = s.nextInt();
            int arr[] = new int[n];
            for(int j =0; j < n; j++) {
                arr[j] = s.nextInt();
            }

            int g = 1;
            int si = 0;
            int b = 0;

            boolean dowski = true;
            boolean dowski2= true;
            boolean dowski3= true;
            int counter = 0;
            for(int z =1; z< n; z++) {
                if(arr[z] < arr[z-1] && counter != 2) {
                    counter++;
                }
                if(counter == 0) {
                    g++;
                }
                else if(counter == 1) {
                    si++;
                }
                else {
                    b++;
                }

                if(g + si + b >= n/2) {
                    break;
                }
            }
            if(g == 0 || b ==0|| si ==0)  {
                System.out.println(0);
                System.out.println(0);
                System.out.println(0);
            }
            else {
                System.out.println(g);
                System.out.println(si);
                System.out.println(b);
            }
        }
    }
}
