#include <bits/stdc++.h>
using namespace std;
int main() {
  int t;
  cin >> t;
  for (int tt = 0; tt < int(t); tt++) {
    int n;
    cin >> n;
    map<int, int> c;
    for (int i = 0; i < int(n); i++) {
      int pi;
      cin >> pi;
      c[-pi]++;
    }
    vector<int> pp;
    for (auto p : c) pp.push_back(p.second);
    bool ok = false;
    int g = pp[0];
    int i = 1;
    int s = 0;
    while (s <= g && i < pp.size()) s += pp[i++];
    if (g < s) {
      int b = 0;
      while (b <= g && i < pp.size()) b += pp[i++];
      while (i < pp.size() && g + s + b + pp[i] <= n / 2) b += pp[i++];
      if (g < b && g + s + b <= n / 2) {
        ok = true;
        cout << g << " " << s << " " << b << endl;
      }
    }
    if (!ok) cout << 0 << " " << 0 << " " << 0 << endl;
  }
}
