#include <bits/stdc++.h>
using namespace std;
int main() {
  int t;
  cin >> t;
  while (t--) {
    long long int a, b, c, d, i, j, k, l, g, s;
    cin >> a;
    map<long long int, long long int> m;
    for (i = 0; i < a; i++) {
      cin >> b;
      auto it = m.find(b);
      if (it == m.end()) {
        m.insert(pair<long long int, long long int>(b, 1));
      } else {
        it->second++;
      }
    }
    int cur = 0;
    d = 0;
    auto it = m.end();
    it--;
    vector<long long int> v, v1;
    while (1) {
      if (it->second + cur > a / 2) break;
      cur = cur + it->second;
      v.push_back(it->second);
      d++;
      if (it == m.begin()) break;
      it--;
    }
    if (d < 3) {
      cout << 0 << " " << 0 << " " << 0 << endl;
      goto P;
    } else {
      g = v[0];
      s = 0;
    }
    i = 1;
    while (1) {
      if (i >= v.size() || s > g) break;
      s += v[i];
      i++;
    }
    b = 0;
    for (j = i; j < v.size(); j++) b += v[j];
    if (g < s && g < b)
      cout << g << " " << s << " " << b << endl;
    else
      cout << 0 << " " << 0 << " " << 0 << endl;
  P:;
  }
}
