#include <bits/stdc++.h>
using namespace std;
const long long MOD = 1e9 + 7;
const double pi = acos(-1.0);
int32_t main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  long long tt;
  cin >> tt;
  while (tt--) {
    long long n;
    cin >> n;
    vector<long long> v;
    map<long long, long long> f;
    set<long long> st;
    map<long long, long long> mp;
    for (long long i = 0; i < n; i += 1) {
      long long p;
      cin >> p;
      if (i < n / 2) {
        st.insert(p);
        f[p]++;
      } else {
        mp[p]++;
      }
    }
    if (st.size() < 3) {
      cout << "0 0 0\n";
    } else {
      for (auto& x : st) {
        v.push_back(x);
      }
      sort(v.begin(), v.end(), greater<long long>());
      long long g = 0, s = 0, b = 0;
      g = f[v[0]];
      for (long long i = 1; i < v.size(); i++) {
        if (g + s + b + f[v[i]] <= n / 2 && s <= g && mp[v[i]] == 0) {
          s += f[v[i]];
        } else if (g + s + b + f[v[i]] <= n / 2 && mp[v[i]] == 0) {
          b += f[v[i]];
        }
      }
      if (g > 0 && s > 0 && b > 0 && g < s && g < b) {
        cout << g << " " << s << " " << b << "\n";
      } else {
        cout << "0 0 0\n";
      }
    }
  }
  return 0;
}
