import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.StringTokenizer;
import java.io.IOException;
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.io.InputStream;

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 */
public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        FastScanner in = new FastScanner(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        TaskA solver = new TaskA();
        solver.solve(1, in, out);
        out.close();
    }

    static class TaskA {
        public void solve(int testNumber, FastScanner in, PrintWriter out) {
            final int N = (int) (4e5 + 100);
            int[] a = new int[N];
            int[] groups = new int[N];

            int numTests = in.nextInt();
            for (int test = 0; test < numTests; test++) {
                int n = in.nextInt();
                for (int i = 0; i < n; i++) {
                    a[i] = in.nextInt();
                }

                int numGroups = 0;
                for (int i = 0; i < n; ) {
                    int j = i;
                    while (j < n && a[i] == a[j]) {
                        ++j;
                    }
                    groups[numGroups++] = j - i;
                    i = j;
                }

                int totalGroups = 0;
                int sum = 0;
                while (totalGroups < n && sum * 2 <= n) {
                    sum += groups[totalGroups];
                    ++totalGroups;
                }
                if (sum * 2 > n) {
                    --totalGroups;
                }

                int g = 0;
                int s = 0;
                int b = 0;
                int i = 0;
                while (i < totalGroups && g <= 0) {
                    g += groups[i];
                    ++i;
                }
                while (i < totalGroups && s <= g) {
                    s += groups[i];
                    ++i;
                }
                while (i < totalGroups) {
                    b += groups[i];
                    ++i;
                }

                if (g < s && g < b) {
                    out.printf("%d %d %d\n", g, s, b);
                } else {
                    out.printf("%d %d %d\n", 0, 0, 0);
                }
            }
        }

    }

    static class FastScanner {
        private BufferedReader in;
        private StringTokenizer st;

        public FastScanner(InputStream stream) {
            in = new BufferedReader(new InputStreamReader(stream));
        }

        public String next() {
            while (st == null || !st.hasMoreTokens()) {
                try {
                    st = new StringTokenizer(in.readLine());
                } catch (IOException e) {
                    throw new RuntimeException(e);
                }
            }
            return st.nextToken();
        }

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

    }
}

