#include <bits/stdc++.h>
using namespace std;
int main() {
  int t;
  cin >> t;
  for (int z = 0; z < t; z++) {
    long long int n, g = 0, s = 0, b = 0, m;
    int p = 0;
    cin >> n;
    m = n / 2;
    vector<long long int> v;
    for (long long int i = 0; i < n; i++) {
      long long int p;
      cin >> p;
      v.push_back(p);
    }
    while (m > 0 && v[n / 2] == v[m - 1]) {
      m--;
    }
    while (v[0] == v[g]) {
      g++;
    }
    if (g < (m / 3)) {
      while (s < m / 3) {
        long long int k = s + g;
        while (v[k] == v[s + g]) {
          s++;
        }
      }
      if ((m - s - g) >= (m / 3)) {
        b = m - s - g;
      } else {
        p = 1;
      }
    } else {
      p = 1;
    }
    if (p == 0) {
      cout << g << " " << s << " " << b << endl;
    } else {
      cout << 0 << " " << 0 << " " << 0 << endl;
    }
  }
  return 0;
}
