import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.sql.SQLOutput;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.HashMap;
import java.util.StringTokenizer;

public class Main {

    public static void main(String[] args) throws IOException {
        FastReader read = new FastReader();
        StringBuilder out = new StringBuilder();
        int t = read.nextInt();
        while (t-- > 0) {
            int n = read.nextInt();
            int arr[] = new int[n];
            for (int i = 0; i < n; i++) {
                arr[i] = read.nextInt();
            }
            int g = getGoldMin(arr);
            int s = getSilverMin(arr, g, g);
            int b = s == 0 ? 0 : getBronzMax(arr, g + s, g);

            if (g == 0 || s == 0 || b == 0) {
                out.append(0).append(' ');
                out.append(0).append(' ');
                out.append(0).append(' ');
                out.append('\n');
                continue;
            }

            out.append(g).append(' ');
            out.append(s).append(' ');
            out.append(b).append(' ');
            out.append('\n');
        }

        System.out.print(out);

    }

    public static int getGoldMin(int arr[]) {
        int g = 0;
        for (int i = 0; i < arr.length; i++) {
            if (i > 0 && arr[i] < arr[i - 1]) {
                break;
            }
            g++;
        }
        return g;
    }

    public static int getSilverMin(int arr[], int start, int g) {
        int s = 0;
        for (int i = start; i < arr.length; i++) {
            if (arr[i] < arr[i - 1] && s > g) {
                break;
            }
            s++;
        }
        if (s <= g) {
            s = 0;
        }
        return s;
    }

    public static int getBronzMax(int arr[], int total, int g) {
        int b = 0;
        int max = arr.length / 2;
        int best = 0;
        for (int i = total; i < arr.length; i++) {
            if (arr[i] < arr[i - 1] && b > g && ((b + total) <= max)) {
                 best = b;
                if (b + total == max) {
                    break;
                }
            }
            b++;
        }
        if (best <= g || total > max) {
            best = 0;
        }
        return best;
    }

    public static int getMin(int g) {
        return g + (g + 1) + (g + 1);
    }

    public static boolean checkBronz(int idx, int arr[]) {
        return arr[idx] > arr[idx + 1];
    }

    public static boolean checkGold(int idx, int arr[]) {
        return arr[idx] > arr[idx + 1];
    }
}

class Pair implements Comparable<Pair> {
    int id;
    int w;

    public Pair(int id, int w) {
        this.id = id;
        this.w = w;
    }

    @Override
    public int compareTo(Pair p) {
        if (this.w != p.w) {
            return this.w - p.w;
        }
        return this.id - p.id;
    }
}

class FastReader {

    BufferedReader br;
    StringTokenizer st;

    public FastReader() {
        br = new BufferedReader(new InputStreamReader(System.in));
    }

    String next() {
        while (st == null || !st.hasMoreElements()) {
            try {
                st = new StringTokenizer(br.readLine());
            } catch (IOException e) {
                e.printStackTrace();
            }
        }
        return st.nextToken();
    }

    int nextInt() {
        return Integer.parseInt(next());
    }

    long nextLong() {
        return Long.parseLong(next());
    }

    double nextDouble() {
        return Double.parseDouble(next());
    }

    String nextLine() {
        String str = "";
        try {
            str = br.readLine();
        } catch (IOException e) {
            e.printStackTrace();
        }
        return str;
    }
}

