#include <bits/stdc++.h>
using namespace std;
int tac;
int n;
int a[400010];
int g, s, b;
vector<int> v;
int main() {
  scanf("%d", &tac);
  while (tac--) {
    scanf("%d", &n);
    for (int i = 0; i < n; i++) scanf("%d", &a[i]);
    v.clear();
    g = s = b = 0;
    int bc = 0;
    for (int i = 0; i < n; i++) {
      if (a[i] != a[bc]) {
        v.push_back(i - bc);
        bc = i;
      }
    }
    v.push_back(n - bc);
    g = v[0];
    int t = 1;
    while (s <= g && s + g + v[t] <= n / 2 && t < v.size()) s += v[t++];
    while (b + s + g + v[t] <= n / 2 && t < v.size()) b += v[t++];
    if (b <= g || s <= g || g + b + s > n / 2) {
      cout << "0 0 0\n";
      continue;
    }
    cout << g << " " << s << " " << b << "\n";
  }
  return 0;
}
