#include <bits/stdc++.h>
using namespace std;
int n, p[400000 + 1];
void quer() {
  cin >> n;
  for (int i = 1; i <= n; i++) cin >> p[i];
  if (n < 6) {
    cout << "0 0 0\n";
    return;
  }
  int g = n + 1, b = 0;
  for (int i = 1; i < n; i++)
    if (p[i] != p[i + 1]) {
      g = i;
      break;
    }
  if (g > n / 6) {
    cout << "0 0 0\n";
    return;
  }
  for (int i = n / 2; i > 0; i--)
    if (p[i] != p[i + 1]) {
      b = i;
      break;
    }
  if (b - g < 2) {
    cout << "0 0 0\n";
    return;
  }
  for (int s = b - g - 1; s > g + g; s--) {
    if (p[s] != p[s + 1]) {
      cout << g << ' ' << s - g << ' ' << b - s << '\n';
      return;
    }
  }
  cout << "0 0 0\n";
}
void run() {
  int t;
  cin >> t;
  for (int i = 0; i < t; i++) quer();
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  run();
  return 0;
}
