import java.util.Scanner;

public class Solution {
  private static Scanner scanner = new Scanner(System.in);
  private static StringBuilder sb = new StringBuilder(16 * 1024);
  private static int N;
  private static int[] arr;

  private static void readInput() {
    N = scanner.nextInt();
    arr = new int[N];
    for (int i = 0; i < N; i++) {
      arr[i] = scanner.nextInt();
    }
  }

  private static boolean rank(int k) {
    if (arr[k - 1] == arr[k]) return false;
    //    System.out.println("K "  + k);
    for (int G = k % 3 == 2 ? k / 3 : k / 3 - 1; G >= 1; G--) {
      //        System.out.println("::G "  + G);
      if (arr[G - 1] == arr[G]) continue;

      int S = G + 1;
      int B = k - G - S;
      sb.append(G).append(" ").append(S).append(" ").append(B);
      return true;
    }
    return false;
  }

  private static void solve() {
    for (int k = N / 2; k >= 5; k--) {
      if (rank(k)) return;
    }
    sb.append("0 0 0");
  }

  public static void main(String[] args) {
    int T = scanner.nextInt();
    for (int t = 0; t < T; t++) {
      sb.delete(0, sb.length());
      readInput();
      solve();
      System.out.println(sb.toString());
    }
  }
}
