#include <bits/stdc++.h>
using namespace std;
const int maxn = 4e5 + 100;
int a[maxn];
int t, n;
int main() {
  scanf("%d", &t);
  while (t--) {
    memset(a, 0, sizeof(a));
    scanf("%d", &n);
    for (int i = 1; i <= n; i++) scanf("%d", &a[i]);
    int num = 1;
    vector<int> v;
    for (int i = 2; i <= n; i++) {
      if (a[i] == a[i - 1])
        num++;
      else {
        v.push_back(num);
        num = 1;
      }
    }
    v.push_back(num);
    int g = v[0];
    int s = 0;
    int b = 0;
    int len = v.size();
    num = 0;
    for (int i = 1; i < len; i++) {
      num += v[i];
      if (s) {
        if (num > g && num + s + g < n / 2) b = num;
      }
      if (!s && num > g) {
        s = num;
        num = 0;
      }
    }
    if (!s || !b || !g)
      puts("0 0 0");
    else
      printf("%d %d %d\n", g, s, b);
  }
}
