#include <bits/stdc++.h>
using namespace std;
int main() {
  int t;
  cin >> t;
  while (t-- > 0) {
    int n;
    cin >> n;
    vector<int> p;
    map<int, int> last_inds;
    for (int i = 0; i < n; i++) {
      int pi;
      cin >> pi;
      p.push_back(pi);
      if (last_inds.find(pi) == last_inds.end()) {
        last_inds.insert(pair<int, int>(pi, i));
      } else {
        last_inds[pi] = i;
      }
    }
    int i = 0;
    int g = 1;
    while (i < p.size() - 1 && p[i] == p[i + 1]) {
      i++;
      g++;
    }
    int s = 0;
    while (i < p.size() - 1 && (p[i] == p[i + 1] || s <= g)) {
      i++;
      s++;
    }
    int ib = (n - 1) / 2 + 1;
    while (ib > 0 && p[ib - 1] == p[ib]) {
      ib--;
    }
    ib--;
    int b = ib - i;
    if (b <= g || g + s + b > n / 2 || i >= p.size() - 1 || b <= 0) {
      cout << "0 0 0" << endl;
    } else {
      cout << g << " " << s << " " << b << endl;
    }
  }
  return 0;
}
