#include <bits/stdc++.h>
using namespace std;
void solve() {
  int n;
  cin >> n;
  vector<int> p(n);
  for (int i = 0; i < (int)n; i++) cin >> p[i];
  int g = 1;
  while (g < n && p[g] == p[g - 1]) g++;
  if (g == n) {
    cout << "0 0 0\n";
    return;
  };
  int s = 1;
  while (g + s < n && (p[g + s] == p[g + s - 1] || s <= g)) s++;
  if (g + s == n) {
    cout << "0 0 0\n";
    return;
  };
  int ansb = 0;
  int b = g + 1;
  while (g + s + b <= n / 2) {
    if (p[g + s + b - 1] != p[g + s + b]) ansb = b;
    b++;
  }
  if (ansb == 0) {
    cout << "0 0 0\n";
    return;
  };
  cout << g << " " << s << " " << ansb << "\n";
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  int t;
  cin >> t;
  while (t--) solve();
}
