#include <bits/stdc++.h>
using namespace std;
int main() {
  int t;
  cin >> t;
  while (t--) {
    int n;
    cin >> n;
    int P[n];
    for (int i = 0; i < n; i++) {
      cin >> P[i];
    }
    if (n < 6) {
      cout << "0 0 0" << endl;
      continue;
    }
    int l = n / 2 - 1;
    while (l >= 0 && P[l] == P[l + 1]) l--;
    vector<int> count;
    int idx = -1;
    for (int i = 0; i <= l; i++) {
      if (i == 0 || !(P[i - 1] == P[i])) {
        count.push_back(1);
        idx++;
      } else {
        count[idx]++;
      }
    }
    int g = 0, s = 0, b = 0;
    if (count.size() > 0) g = count[0];
    int i;
    for (i = 1; i < count.size() && s <= g; i++) {
      s += count[i];
    }
    for (; i < count.size(); i++) {
      b += count[i];
    }
    if (g == 0 || s == 0 || b == 0 || s <= g || b <= g) {
      cout << "0 0 0" << endl;
    } else {
      cout << g << " " << s << " " << b << endl;
    }
  }
  return 0;
}
