#include <bits/stdc++.h>
using namespace std;
signed main() {
  long long q;
  cin >> q;
  while (q--) {
    long long n, g = 1, s = 1, b = 1;
    cin >> n;
    vector<long long> p(n);
    for (long long i = 0; i < n; ++i) cin >> p[i];
    for (long long i = 1; i < n && p[i] == p[i - 1]; ++i) ++g;
    for (long long i = g + 1; i < n && p[i] == p[i - 1]; ++i) ++s;
    for (long long i = g + s + 1; i < n && p[i] == p[i - 1]; ++i) ++b;
    if (s + b + g > n / 2)
      cout << "0 0 0\n";
    else {
      vector<long long> be;
      be.push_back(b);
      long long prevb = -1;
      while (b + s + g <= n / 2 && prevb != b) {
        be.push_back(b - prevb);
        prevb = b;
        ++b;
        bool in = 0;
        for (long long i = g + s + prevb + 1; i < n && p[i] == p[i - 1]; ++i) {
          ++b;
          in = 1;
        }
        if (!in) --b;
      }
      b = prevb;
      long long j = 0;
      while (g >= s && j < be.size()) {
        if (b - be[j] > 0) {
          s += be[j];
          b -= be[j];
          ++j;
        } else
          break;
      }
      if (g >= s || g >= b)
        cout << "0 0 0\n";
      else
        cout << g << " " << s << " " << b << '\n';
    }
  }
  return 0;
}
