#include <bits/stdc++.h>
using namespace std;
int a[400005], b[400005];
int main() {
  int t;
  scanf("%d", &t);
  while (t--) {
    int g = -1, s = -1, b0 = -1, cnt = 0;
    int n;
    scanf("%d", &n);
    for (int i = 1; i <= n; i++) {
      scanf("%d", &a[i]);
    }
    int pos = n / 2;
    if (a[n / 2] == a[n / 2 + 1]) {
      while (1) {
        if (a[pos] == a[pos - 1]) {
          pos--;
        } else {
          pos--;
          break;
        }
      }
    }
    int k = 1;
    for (int i = pos; i >= 1; i--) {
      if (a[i] == a[i - 1]) {
        k++;
      } else {
        cnt++;
        b[cnt] = k;
        k = 1;
      }
    }
    g = b[cnt];
    int sum = 0;
    for (int i = 1; i < cnt; i++) {
      sum += b[i];
      if (sum > g) {
        b0 = sum;
        break;
      }
    }
    s = pos - g - b0;
    if (s <= 0 || b0 <= 0 || g <= 0 || s <= g)
      printf("0 0 0\n");
    else
      printf("%d %d %d\n", g, s, b0);
  }
}
