#include <bits/stdc++.h>
using namespace std;
int main() {
  int t;
  cin >> t;
  while (t--) {
    int n, i;
    cin >> n;
    map<int, int> mp;
    for (i = 0; i < n; ++i) {
      int num;
      cin >> num;
      mp[-num]++;
    }
    vector<int> vp;
    map<int, int>::iterator it;
    for (it = mp.begin(); it != mp.end(); ++it) {
      vp.push_back(it->second);
    }
    int g = 0, b = 0, s = 0;
    g += vp[0];
    i = 1;
    while (s <= g && i < vp.size()) s += vp[i], ++i;
    while (b <= g && i < vp.size()) b += vp[i], ++i;
    while (i < vp.size() && g + b + s + vp[i] <= n / 2) b += vp[i], ++i;
    if (s + b + g <= n / 2 && g < b && g < s && g > 0 && b > 0 && s > 0)
      cout << g << " " << s << " " << b << "\n";
    else
      cout << 0 << " " << 0 << " " << 0 << "\n";
  }
}
