#include <bits/stdc++.h>
using namespace std;
template <class T>
void dbs(string str, T t) {
  cerr << str << " : " << t << "\n";
}
template <class T, class... S>
void dbs(string str, T t, S... s) {
  int idx = str.find(',');
  cerr << str.substr(0, idx) << " : " << t << ",";
  dbs(str.substr(idx + 1), s...);
}
template <class S, class T>
ostream& operator<<(ostream& os, const pair<S, T>& p) {
  return os << "(" << p.first << ", " << p.second << ")";
}
template <class T>
void debug(T a, T b) {
  cerr << "[";
  for (T i = a; i != b; ++i) {
    if (i != a) cerr << ", ";
    cerr << *i;
  }
  cerr << "]\n";
}
void solve() {
  int n;
  cin >> n;
  vector<pair<int, int>> problemsSolved;
  for (int i = 0; i < n; ++i) {
    int p;
    cin >> p;
    if (problemsSolved.empty() or problemsSolved.back().first != p) {
      problemsSolved.push_back({p, 0});
    }
    ++problemsSolved.back().second;
  }
  int g = problemsSolved[0].second;
  int s = 0;
  int b = 0;
  int silverIdx = -1;
  for (int i = 1; i < problemsSolved.size(); ++i) {
    s += problemsSolved[i].second;
    if (s > g) {
      silverIdx = i;
      break;
    }
  }
  for (int i = silverIdx + 1; i < problemsSolved.size(); ++i) {
    int extra = problemsSolved[i].second;
    if (2 * (g + s + b + extra) <= n) {
      b += extra;
    } else {
      break;
    }
  }
  if (g >= s or g >= b or (g + s + b) * 2 > n) {
    g = s = b = 0;
  }
  cout << g << " " << s << " " << b << "\n";
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  int T;
  cin >> T;
  while (T--) {
    solve();
  }
  return 0;
}
