#include <bits/stdc++.h>
const long double PI = 3.141592653589793236L;
using namespace std;
void solve() {
  int n;
  cin >> n;
  vector<int> p(n + 1);
  for (int i = 1; i <= n; i++) {
    cin >> p[i];
  }
  int g = 1, s = 0, b = 0;
  int mid = p[n / 2 + 1];
  int pos = 0;
  for (int i = 1; i <= n; i++) {
    if (p[i] == mid) {
      break;
    }
    pos++;
  }
  int i;
  for (i = 2; i <= n; i++) {
    if (p[i] != p[i - 1]) {
      break;
    }
    g++;
  }
  s = g + 1;
  for (i = s + g + 1; i <= n; i++) {
    if (p[i] != p[i - 1]) {
      break;
    }
    s++;
  }
  b = g + 1;
  if (i > pos) {
    cout << "0 0 0\n";
    return;
  }
  for (i = s + g + b + 1; i <= pos; i++) {
    b++;
  }
  cout << g << " " << s << " " << b << "\n";
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  long long int T = 1;
  cin >> T;
  while (T--) {
    solve();
  }
  return 0;
}
