#include <bits/stdc++.h>
using namespace std;
const int INF = 2147483647;
const int N = 400005;
int z, n, tab[N], ind, ind2, i;
bool f;
int main() {
  scanf("%d", &z);
  while (z--) {
    scanf("%d", &n);
    for (i = 0; i < n; i++) scanf("%d", &tab[i]);
    ind = -1;
    for (i = 0; i < n / 2; i++)
      if (tab[i] != tab[i + 1]) ind = i;
    if (ind == -1) {
      printf("0 0 0\n");
      continue;
    }
    for (i = 0; i < n / 2; i++)
      if (tab[i] != tab[i + 1]) {
        ind2 = i;
        break;
      }
    if (ind2 == ind) {
      printf("0 0 0\n");
      continue;
    }
    f = false;
    for (i = ind2 + 1; i < n / 2; i++)
      if (tab[i] != tab[i + 1] && i != ind && ind2 + 1 < i - ind2 &&
          ind2 + 1 < ind - i) {
        f = true;
        printf("%d %d %d\n", ind2 + 1, i - ind2, ind - i);
        break;
      }
    if (!f) printf("0 0 0\n");
  }
  return 0;
}
