#include <bits/stdc++.h>
using namespace std;
void solve() {
  int n;
  cin >> n;
  vector<int> v;
  int prev = -1;
  for (int i = 1; i <= n; i++) {
    int curr;
    cin >> curr;
    if (prev != -1 && prev != curr) v.emplace_back(i - 1);
    prev = curr;
  }
  v.emplace_back(n + 1);
  int sz = upper_bound(v.begin(), v.end(), n / 2) - v.begin();
  sz--;
  int g = v[0];
  for (int i = sz; i > 0; i--) {
    int b = v[i];
    int s = *upper_bound(v.begin(), v.end(), g * 2);
    if (g < s - g && g < b - s) {
      cout << g << " " << s - g << " " << b - s << "\n";
      return;
    }
  }
  cout << "0 0 0\n";
  return;
}
int main() {
  cin.tie(nullptr);
  ios::sync_with_stdio(false);
  int t;
  cin >> t;
  while (t--) solve();
  return 0;
}
