#include <bits/stdc++.h>
using namespace std;
const int N = 4e5;
const int mod = 1e4 + 7;
int a[N + 5];
int b[N + 5];
int main() {
  int T;
  scanf("%d", &T);
  while (T--) {
    int n;
    scanf("%d", &n);
    int sum = 0;
    for (int i = 0; i < n; i++) {
      scanf("%d", &a[i]);
      if (i == 0)
        b[i] = 1;
      else {
        if (a[i] == a[i - 1])
          b[sum]++;
        else {
          sum++;
          b[sum] = 1;
        }
      }
    }
    int cnt = 0, ans = 0;
    for (int i = 0; i <= sum; i++) {
      if (ans + b[i] > n / 2)
        break;
      else {
        ans = ans + b[i];
        cnt++;
      }
    }
    if (cnt < 3) {
      printf("0 0 0\n");
    } else {
      int g = 0, s = 0;
      g = b[0];
      for (int i = 1; i <= cnt; i++) {
        s = s + b[i];
        if (s > g) break;
      }
      if (ans - g - s <= g) {
        printf("0 0 0\n");
      } else {
        printf("%d %d %d\n", g, s, ans - g - s);
      }
    }
  }
  return 0;
}
