import java.util.*;
 
public class CodeForces {
  
 
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
 
        int t = scanner.nextInt();
        while ((t-- != 0)) {
            int n = scanner.nextInt();
            if(n/2 < 5){
                while((n--) != 0){scanner.nextInt();}
                
                System.out.println("0 0 0");
                continue;
            }
            
            Map<Integer, Integer> map = new TreeMap<>();
            for (int i = 0; i < n; i++) {
                int pi = scanner.nextInt();
                // if(i<n/2){
                    map.put(-pi, map.getOrDefault(-pi,0) + 1);
                // }
            }
            int medals[] = new int[3];
            Iterator<Map.Entry<Integer, Integer>> itr = map.entrySet().iterator();
            medals[0] = itr.next().getValue();
            int j = 1;
            int m = medals[0];
            while(itr.hasNext()){
                int num = itr.next().getValue();
                if(m + num > n/2){
                    break;
                }
                m += num;
                medals[j] += num;
                if(medals[j] > medals[0] && j<2){
                    j++;
                }
            }
            
            String ans = "0 0 0";
            if(medals[0] != 0 && medals[1] != 0 && medals[2] != 0
                && medals[0] < medals[1] && medals[0] < medals[2]){
                ans = medals[0] +" "+medals[1]+" "+medals[2];
            }
            System.out.println(ans);
        }
    }
}