#include <bits/stdc++.h>
using namespace std;
const int Max = 2e6 + 5;
int lst[Max];
int main() {
  int t;
  cin >> t;
  while (t--) {
    int n;
    cin >> n;
    map<int, int> ma;
    for (int i = 1; i <= n; i++) {
      cin >> lst[i];
      ma[lst[i]]++;
    }
    int s1 = ma[lst[1]], s2 = 0, s3 = 0;
    for (auto i = ma.begin(); i != ma.end(); i++) {
      if (ma.size() <= 3) break;
      if (i == ma.begin()) i++;
      if (s2 <= s1)
        s2 += i->second;
      else {
        if (s1 + s2 + s3 + i->second > n / 2) break;
        s3 += i->second;
      }
    }
    if (s2 <= s1 || s3 <= s1)
      cout << "0 0 0" << endl;
    else
      cout << s1 << " " << s2 << " " << s3 << endl;
  }
}
