#include <bits/stdc++.h>
using namespace std;
;
const long long MOD = (long long)1e9 + 7;
const unsigned long long MAX_SIZE = (unsigned long long)1e5 + 7;
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];
    }
    int lastAwardee = n / 2 - 1;
    if (P[lastAwardee] == P[lastAwardee + 1]) {
      while (lastAwardee > 0 && P[lastAwardee] == P[--lastAwardee])
        ;
    }
    if (lastAwardee <= 0) {
      cout << "0 0 0" << endl;
      continue;
    }
    vector<int> groups;
    int idx = 0;
    groups.push_back(1);
    for (int i = 1; i <= lastAwardee; i++) {
      if (P[i] == P[i - 1]) {
        groups[idx]++;
      } else {
        groups.push_back(1);
        idx++;
      }
    }
    int g = groups[0];
    int s = 0, b = 0;
    idx = 1;
    int size = groups.size();
    while (idx < size && s <= g) {
      s += groups[idx++];
    }
    while (idx < size) {
      b += groups[idx++];
    }
    if (s <= g || b <= g) {
      cout << "0 0 0" << endl;
    } else {
      cout << g << " " << s << " " << b << endl;
    }
  }
  return 0;
}
