#include <bits/stdc++.h>
#pragma optimizitaion_level 3
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("fast-math")
using namespace std;
signed main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  int q;
  cin >> q;
  while (q--) {
    int n;
    cin >> n;
    vector<int> p, cnt;
    for (int i = 0; i < n; i++) {
      int a;
      cin >> a;
      if (p.empty() || p.back() != a) {
        p.push_back(a);
        cnt.push_back(1);
      } else {
        cnt.back()++;
      }
    }
    int g = cnt[0], s = 0, b = 0, i = 1;
    for (; i < n && s <= g; i++) {
      s += cnt[i];
    }
    if (i == n) {
      cout << "0 0 0\n";
      continue;
    }
    for (; i < n && b <= g; i++) {
      b += cnt[i];
    }
    if (b <= g || s <= g) {
      cout << "0 0 0\n";
      continue;
    }
    if (g + s + b <= n / 2) {
      for (; i < n; i++) {
        if (g + s + b + cnt[i] <= n / 2) {
          b += cnt[i];
        } else {
          break;
        }
      }
      cout << g << " " << s << " " << b << '\n';
    } else {
      cout << "0 0 0\n";
    }
  }
  return 0;
}
